[PDF] Top 20 Round-Optimal Black-Box Two-Party Computation
Has 10000 "Round-Optimal Black-Box Two-Party Computation" found on our website. Below are the top 20 most common "Round-Optimal Black-Box Two-Party Computation".
Round-Optimal Black-Box Two-Party Computation
... of black-box access to cryptographic ...constant round multi-party protocol where the party have only black-box access to a ...first black-box constructions ... See full document
30
Round-Optimal Secure Multiparty Computation with Honest Majority
... with black-box simulation are known to require at least four rounds ...three round maliciously secure protocol, we leverage the fact that we are in the honest majority ... See full document
30
Two-Round MPC: Information-Theoretic and Black-Box
... of computation consists of the parties running an instance of a protocol Π, an adversary A that controls the communication among the parties, and an environment Z that controls the inputs to the parties and sees ... See full document
60
A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement
... multi-party computation (MPC) for arbitrary functionalities [Yao82, Yao86, Kil88, IPS08, IKO + 11, BL18, ...high round complexity (as, e.g., in [Hai08]), while the optimal number of rounds ... See full document
38
On the Exact Round Complexity of Secure Three-Party Computation
... exact round complexity of ...Since round complexity is considered an important measure of effi- ciency of MPC protocols, there is a rich body of work studying the round complexity of secure 2PC and ... See full document
70
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
... first round of the protocol while decommitting in the third ...first round, can maul it to another commitment that can be open to a valid accepting response depending on the decommitment provided by the ... See full document
22
Black-Box Non-Black-Box Zero Knowledge
... (e.g., round complexity, security in a concurrent setting, complexity of the players, underlying assumptions) are taken into ...for two-party computation starting from any ... See full document
73
Round Optimal Black-Box Commit-and-Prove
... four round commit and prove ZK protocol follows the FLS paradigm [8] ...run two special purpose witness indistinguishable protocols in op- posite directions between the prover P and the verifier V ... See full document
28
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ
... the computation of the table of g might not agree with the inputs used for the computation of the table of g 0 ...offline computation must verify the consistency of the computations of different ...a ... See full document
41
A New Approach to Black-Box Concurrent Secure Computation
... (non-black- box) SPS-secure concurrent MPC protocol of Garg et ...each party commits to a witness for the fact that the “trapdoor statement” is false, where the trapdoor statement is a statement ... See full document
57
From FE Combiners to Secure MPC and Back
... multi-party computation protocol that is both round-optimal (two rounds) and communication efficient (depends only on circuit ...honest party inputs from their combined view of ... See full document
51
Efficient Two Party and Multi Party Computation against Covert Adversaries
... of computation on a fast CPU. Non-black-box constructions require parties to prove in zero-knowledge, statements that involve the computation of the under- lying primitives, say a trapdoor ... See full document
18
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
... Composable security. The concurrent setting, in which many instances of protocols are executed concurrently in an arbitrary schedule, is a more general and realistic setting than the stand-alone one. In the concurrent ... See full document
39
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
... As a strong and realistic security notion in the concurrent setting, Canetti [Can01] proposed uni- versally composable (UC) security. The main advantage of UC security is composability, which guarantees that UC-secure ... See full document
56
Outsourcing Secure Two-Party Computation as a Black Box
... true black box outsourcing of any SMC protocol (reactive or non-reactive), and our empirical performance evaluation demonstrates that the overhead of adding AND operations to the circuit is minimal when the ... See full document
17
Round-Optimal Secure Multi-Party Computation
... the two-party setting, the recent work of Ciampi et ...string, two-round constructions can be obtained [GGHR14a, MW16] or three- round assuming tamper-proof hardware tokens ...three ... See full document
53
Fp-Tree Algorithm Using Modified-Ck Secure Sum Method
... every party does not have information on dissimilar ...multi party computation. Secure multi party computation being used in huge scale databases which extends to protect privacy to the ... See full document
9
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
... the two- round MPC protocols of [BL18, GS18] to obtain a protocol that minimizes the number of public key ...the round complexity of a conforming protocol to two ...first round, every ... See full document
55
Linear Overhead Optimally-resilient Robust MPC Using Preprocessing
... In [28], a computationally-secure MPC protocol with t < n/2 and communication complexity O(n) per multi- plication is presented. The protocol is not designed in the pre-processing model, but rather in the ... See full document
24
Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds
... honest party who intends to erase data—to ensure that all traces of data are ...secure two-party computation is much easier with the assumption of secure erasure [26] than without ... See full document
26
Related subjects