Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

By Yehuda Lindell. 2001

245 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, methodology): “We use witness-extended emulation to define knowledge-soundness as used for example in [BCC ` 16] and defined in [GI08b, Lin03].”
A Verifiable Secret Shuffle of Homomorphic Encryptions (2003, unknown): “Lindell’s definition pertains to proofs of knowledge in the plain model, we will adapt his definition to the setting of public coin arguments in the common reference string model.”
Transparent SNARKs from DARK Compilers (2020, background): “The triple ( Setup , P , V ) is called an argument for relation R if for all non-uniform PPT adversaries A the following properties hold: Deﬁnition 2 (Witness-extended emulation [36,41]).”
Efficient Zero-Knowledge Argument for Correctness of a Shuffle (2012, methodology): “To define an argument of knowledge we follow the approach of Groth and Ishai [GI08] and do it through witness-extended emulation first introduced by Lindell [Lin03].”
Securely outsourcing linear algebra computations (2010, background): “Furthermore, there has been a lot of work recently in introducing protocols that are e.cient for general SMC [23, 20, 11].”
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (2011, background): “Thus, formally S runs the witness-extended emulator of [26] that achieves the above effect.”
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016, background): “To define an argument of knowledge we follow Groth and Ishai [23] that borrowed the term witness-extended emulation from Lindell [29].”
Proofs of Storage from Homomorphic Identification Protocols (2009, methodology): “Given a ppt adversary A attacking ΣShoup, we construct a ppt algorithm B computing square roots modulo N output by GenBlum.”
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (2008, methodology): “In particular, in [19] the committer first sends a commitment c = com(s1; r1) for s1 ∈R {0,1}n, and then the parties engage in a zero-knowledge argument of knowledge in which P1 proves it knows s1.”
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, methodology): “We do not use the standard definition of special soundness because our verifier provides two challenges, but rather the generalized notion of witness-extended emulation [53].”
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008, background): “Whereas Lindell’s definition pertains to proofs of knowledge in the plain model, we will adapt his 5 The standard definition ofproofsof knowledge by Bellare and Goldreich [5] does not apply in our setting, since we work in the common random string model and are interested inarguments of knowledge.”
Doubly-Efficient zkSNARKs Without Trusted Setup (2018, background): “To define this notion formally, we follow Groth and Ishai [54] who borrow the notion of statistical witness-extended emulation from Lindell [68]:”