See this document in CiteSeerX!

The Round-Complexity of Black-Box Concurrent Zero-Knowledge (2003)  (Make Corrections)  
Alon Rosen



  Home/Search   Context   Related

 
View or download:
mit.edu/~alon/PAPERS/thesis...thesis.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/~alon/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Zero-knowledge proof systems are interactive protocols that enable one party, called the prover, to convince another party, called the verifier, in the truth of a statement without revealing anything beyond the validity of the assertion being proved. Besides being fascinating on their own right, zeroknowledge proofs serve as an extremely useful tool for the realization of many cryptographic tasks. The original setting in which zero-knowledge proofs were investigated consisted of a single ... (Update)

Similar documents (at the sentence level):
15.0%:   Black-Box Concurrent Zero-Knowledge Requires (almost) .. - Canetti, Kilian.. (2002)   (Correct)
14.9%:   Black-Box Concurrent Zero-Knowledge Requires \Omega(log .. - Canetti, Kilian.. (2001)   (Correct)
5.2%:   A note on the round-complexity of Concurrent Zero-Knowledge - Rosen (2000)   (Correct)

Active bibliography (related documents):   More   All
0.4:   New Notions of Security: Achieving Universal Composability.. - Prabhakaran, Sahai (2004)   (Correct)
0.4:   Concurrent Zero Knowledge with Logarithmic Round-Complexity - Manoj Prabhakaran Alon (2002)   (Correct)
0.3:   A Note on Constant-Round Zero-Knowledge Proofs for NP - Rosen   (Correct)

Similar documents based on text:   More   All
0.5:   Probabilistic Proof Systems - Part I - Vadhan (2000)   (Correct)
0.3:   Completeness in Two-Party Secure Computation Revisited - Harnik, Naor, Reingold, Rosen   (Correct)
0.3:   Completeness in Two-Party Secure Computation - A.. - Harnik, Naor.. (2004)   (Correct)

BibTeX entry:   (Update)

@misc{ rosen-roundcomplexity,
  author = "Alon Rosen",
  title = "The Round-Complexity of Black-Box Concurrent Zero-Knowledge",
  url = "citeseer.ist.psu.edu/rosen03roundcomplexity.html" }
Citations (may not include all citations):
531   The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
501   A Digital Signature Scheme Secure Against Adaptive Chosen Me.. - Goldwasser, Micali et al. - 1988
411   How to Prove Yourself: Practical Solution to Identification .. - Fiat, Shamir - 1987
208   Universal One-Way Hash Functions and their Cryptographic App.. - Naor, Yung - 1989
206   Zero Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988
194   Proofs that Yield Nothing But Their Validity or All Language.. (context) - Goldreich, Micali et al. - 1991
185   How to Generate and Exchange Secrets (context) - Yao - 1986
147   Efficient Signature Generation by Smart Cards (context) - Schnorr - 1991
124   Bit Commitment using Pseudorandomness - Naor - 1991
111   the Composition of Zero-Knowledge Proof Systems - Goldreich, Krawczyk - 1996
99   Foundation of Cryptography -- Basic Tools (context) - Goldreich - 2001
98   How to Play any Mental Game -- A Completeness Theorem for Pr.. (context) - Goldreich, Micali et al. - 1987
94   Concurrent Zero-Knowledge - Dwork, Naor et al. - 1998
85   Construction of Pseudorandom Generator from any One-Way Func.. - Hastad, Impagliazzo et al. - 1999
67   Definitions and Properties of Zero-Knowledge Proof Systems - Goldreich, Oren - 1994
63   How to Construct Constant-Round Zero-Knowledge Proof Systems.. - Goldreich, Kahan - 1996
51   the Concurrent Composition of Zero-Knowledge Proofs (context) - Richardson, Kilian - 1999
41   Lower Bounds for Zero-Knowledge on the Internet - Kilian, Petrank et al. - 1998
38   Witness Indistinguishability and Witness Hiding Protocols (context) - Feige, Shamir - 1990
37   Concurrent Zero-Knowledge: Reducing the Need for Timing Cons.. - Dwork, Sahai - 1998
37   a set of Almost Deterministic k-Independent Random Variables (context) - Joffe - 1974
35   A Note on Efficient Zero-Knowledge Proofs and Arguments (context) - Kilian - 1992
27   the Existence of 3-Round Zero-Knowledge Protocols - Hada, Tanaka - 1998
22   Alternative Models for Zero Knowledge Interactive Proofs (context) - Feige, thesis - 1990
20   Concurrent and Resettable Zero-Knowledge in Poly-logarithmic.. (context) - Kilian, Petrank - 2001
20   A note on the round-complexity of Concurrent Zero-Knowledge - Rosen
13   Concurrent Zero-Knowledge with Logarithmic Round Complexity - Prabhakaran, Rosen et al. - 2002
8   Zero-Knowledge Arguments for NP can be Based on General Assu.. (context) - Naor, Ostrovsky et al. - 1998
6   Concurrent Zero-Knowledge with Timing -- Revisited - Goldreich - 2002
3   Bounded-Concurrent Secure Two-Party Computation in a Constan.. - Pass, Rosen - 2003
1   Completeness in Two-Party Secure Computation Revisited - Harnik, Naor et al.

Documents on the same site (http://theory.lcs.mit.edu/~alon/):   More
Constant-Round Oblivious Transfer in the Bounded Storage.. - Ding, Harnik, Rosen.. (2004)   (Correct)
Completeness in Two-Party Secure Computation - A.. - Harnik, Naor.. (2004)   (Correct)
Bounded-Concurrent Secure Two-Party Computation in a Constant.. - Pass, Rosen (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC