[PDF] Top 20 Round-Optimal Secure Multiparty Computation with Honest Majority
Has 10000 "Round-Optimal Secure Multiparty Computation with Honest Majority" found on our website. Below are the top 20 most common "Round-Optimal Secure Multiparty Computation with Honest Majority".
Round-Optimal Secure Multiparty Computation with Honest Majority
... a multiparty interactive protocol between a single prover and multiple verifiers where the soundness and zero knowledge properties only hold when a majority of the parties are ...the honest verifiers ... See full document
30
Non-Interactive Secure Multiparty Computation
... involving secure computations without interaction, such as the one described ...be honest-but-curious, offering protection against malicious parties in the above model is in some sense easier than in the ... See full document
43
Protocols for Multiparty Coin Toss With Dishonest Majority
... constant-round secure-with-abort protocol with the ability to detect cheating by using methods from Pass ...constant-round multiparty secure-with-abort computation for any ... See full document
45
Secure Multiparty Computation with General Interaction Patterns
... as majority) where the size of the residual truth table is not very significant (see [3] for a discussion), as well as unlearnable functions where it is computationally hard to figure out the inputs of ... See full document
56
Characterization of Secure Multiparty Computation Without Broadcast
... a secure setup phase are not available, 5 specifi- cally, when considering multiparty protocols (involving more than two parties), in which the parties are connected only via a point-to-point network ... See full document
23
Two Round Multiparty Computation via Multi-Key FHE
... on round complexity of MPC. In the honest-but-curious setting, it was known how to achieve a constant number of rounds assuming the existence of oblivious transfer [BMR90, IK00, Lin01, KOS03, ...into ... See full document
33
Fair and Efficient Secure Multiparty Computation with Reputation Systems
... out secure multiparty computa- ...of secure computation in this setting, and carry out a theoretical study of ...fair secure com- putation in our ...an honest ma- jority is ... See full document
20
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE without a CRS
... for secure multiparty computation (MPC) protocols, MFHE can be more advantageous than usual fully homomorphic encryption (FHE) since users do not need to agree with a common public key before the ... See full document
13
Adaptively Secure Multi-Party Computation with Dishonest Majority
... include round efficient protocols both in the setting of erasures and ...erasures, honest parties are certainly not required to erase their ...allow honest parties to erase their inputs during the ... See full document
26
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity
... unconditionally secure MPC protocols have been proposed [23, 22, 3, 18, 5, ...unconditionally secure MPC protocols have linear ...the optimal resilience of t < n/3 and t < n/2 ... See full document
35
On the Exact Round Complexity of Secure Three-Party Computation
... the honest majority setting tolerating a malicious ...exact round complexity of ...Since round complexity is considered an important measure of effi- ciency of MPC protocols, there is a rich ... See full document
70
Round-Optimal Black-Box Two-Party Computation
... constant round multi-party protocol where the party have only black-box access to a ...sub-linear round complexity for MPC, which Goyal [Goy11] improves to obtain constant- round MPC constructions ... See full document
30
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
... fine-grained secure and satisfies key availability) along with the two- round MPC protocols of [BL18, GS18] to obtain a protocol that minimizes the number of public key ...the round complexity of a ... See full document
55
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
... We first focus on the very basic case of two parties with honest-but-curious corruptions. Even here there is a large gap between the best-known protocols and what is potentially possible: In the static case (where ... See full document
54
Round-Optimal Secure Multi-Party Computation
... an honest party to abort, and such an event will be independent of the inputs of the honest ...an honest party does not abort and completes evaluation, then the result is ...the honest party ... See full document
53
Preprocessing-Based Verification of Multiparty Protocols with Honest Majority
... n-party computation protocol, with each party acting as the prover in one instance, gives us a protocol secure against covert (if verification is performed at the end) or fully malicious (if each protocol ... See full document
51
On the Message Complexity of Secure Multiparty Computation
... over secure point-to-point channels or, more generally, even when allowing an arbitrary input-independent correlated randomness ...an optimal number of mes- sages. Using recent constructions of ... See full document
16
Privacy Preserving Q-learning in the Analog Model for Secure Multiparty Computation
... secret computation processing which does not use such complicated cryptographic processing and homomorphic ...using secure divided data in the analog model are ... See full document
6
Cut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure Two-party Computation
... of secure two-party computation proposed by Yao [16] is secure only in semi- honest model, the cut-and-choose technique used for constructing secure protocols in the presence of ... See full document
18
Two-Round Multiparty Secure Computation from Minimal Assumptions
... In contrast, much less is known about the assumptions that two-round MPC can be based on (constant-round MPC protocols based on any OT protocol are well-known [BMR90]). In partic- ular, two-round MPC ... See full document
40
Related subjects