Efficient Concurrent Zero-Knowledge in the Auxiliary String Model

By Ivan Bjerre Damgård. International Conference on the Theory and Application of Cryptographic Techniques, 2000

332 citations recorded by the source corpus.

How researchers see this paper

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

Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008, methodology): “We can now use the standard techniques for converting honest verifier zero-knowledge arguments to full zero-knowledge arguments [10, 18, 22].”
Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks (2004, methodology): “Our compiler uses ideas from both the works of Damgård [16] and Katz [27], with the only difference that it uses multi-trapdoor instead of regular trapdoor commitments in order to achieve concurrent non-malleability. and later refined and improved in [31], is very related to our notion of MTC.”
A Signature Scheme with Efficient Protocols (2002, neutral): “[17]).”
A Verifiable Secret Shuffle of Homomorphic Encryptions (2003, methodology): “We also remark that there are efficient techniques to convert SHVZK arguments into zero-knowledge arguments for arbitrary verifiers in the common reference string model [11,21,24].”
Universally Composable Commitments (2001, background): “Other equivalent terms include the reference string model [d00] and the public parameter model [ff00].”