搜索结果: 1-15 共查到“军事学 Honest majority”相关记录18条 . 查询时间(0.057 秒)
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
Fairness and Guaranteed Output Delivery MPC Round Complexity
2019/9/5
Two of the most sought-after properties of Multi-party Computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also referred to as robustness. Achieving both, however...
Improved Building Blocks for Secure Multi-Party Computation based on Secret Sharing with Honest Majority
cryptographic protocols secret sharing
2019/6/19
Secure multi-party computation permits evaluation of any desired functionality on private data without disclosing the data to the participants and is gaining its popularity due to increasing collectio...
An Efficient Secure Three-Party Sorting Protocol with an Honest Majority
sorting secret sharing three-party computation
2019/6/13
We present a novel three-party sorting protocol secure against passive adversaries in the honest majority setting. The protocol can be easily combined with other secure protocols which work on shared ...
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest
secure multiparty computation honest majority concrete efficiency
2019/6/5
Secure multiparty computation (MPC) enables a set of parties to securely carry out a joint computation of their private inputs without revealing anything but the output. Protocols for semi-honest adve...
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries
honest majority arithmetic circuits information-theoretic security
2018/6/6
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be pre...
Guaranteed output delivery: We also construct protocols that achieve security with guaranteed output delivery: (i) Against fail-stop adversaries, we construct two round MPC either in the (bare) public...
Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification
cryptographic protocols multi-party computation
2018/5/28
In this paper, we present two new and very communication-efficient protocols for maliciously secure multi-party computation over fields in the honest-majority setting with abort. Our first protocol im...
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority
secret sharing bit-decomposition modulus conversion
2018/5/2
Secure computation enables parties with inputs to compute a function on the inputs while keeping
them secret. There are security notions that secure computation should satisfy, e.g., privacy, meaning...
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority
cryptographic protocols Honest-Majority
2017/9/1
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be pre...
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority
secret sharing universal construction rushing cheater
2017/5/26
For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and reconstruct the...
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
secure multiparty computation honest majority concrete efficiency
2016/12/10
In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure {\em three}-party computation with an honest majority. The protocol has very minimal c...
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
secure multiparty computation malicious adversaries honest majority
2016/12/8
In this paper, we describe a new protocol for secure three-party computation of any functionality, with an honest majority and a \textit{malicious} adversary. Our protocol has both an information-theo...
Verifiable Computation in Multiparty Protocols with Honest Majority
Secure multiparty computation verifiable computation linear PCP
2016/1/26
We present a generic method for turning passively secure
protocols into protocols secure against covert attacks. The method adds
a post-execution verification phase to the protocol that allows a mis...
Preprocessing-Based Verification of Multiparty Protocols with Honest Majority
secure multiparty computation verification
2015/12/29
This paper presents a generic method for turning passively
secure protocols into protocols secure against covert attacks, adding an
offline preprocessing and a cheap post-execution verification phas...
Linear Overhead Robust MPC with Honest Majority Using Preprocessing
cryptographic protocols MPC protocol
2015/12/24
We present a technique to achieve O(n) communication complexity per multiplication for a wide class
of robust practical MPC protocols. Previously such a communication complexity was only known in the...