Simulation in quasi-polynomial time, and its application to protocol composition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2656, Issue , 2003, Pages 160-176

  Pass, Rafael ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS;

ADVANCED COMPOSITION; ITS APPLICATIONS; ONE-WAY FUNCTIONS; PROTOCOL COMPOSITION; QUASI-POLYNOMIAL TIME; STANDARD DEFINITIONS; STANDARD TYPE; ZERO KNOWLEDGE;

POLYNOMIAL APPROXIMATION;

EID: 35248833045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_10     Document Type: Article

References (34)

1. Boaz Barak, "How to Go Beyond the Black-Box Simulation Barrier", 42nd FOCS, pp. 106-115, 2001
2. Boaz Barak, Yehuda Lindell "Strict polynomial-time in simulation and extraction", 34th STOC, pp. 484-493, 2002
3. Dan Boneh, Moni Naor, "Timed Commitments", Crypto00, Springer LNCS 1880, pp. 236-254, 2000
4. Manuel Blum, "Coin Flipping by Telephone", Crypto81, ECE Report 82-04, ECE Dept., UCSB, pp. 11-15, 1982
5. M. Blum, "How to prove a theorem so no one else can claim it", Proc. of the International Congress of Mathematicians, pp. 1444-1451, 1986
6. Ran Canetti, "Universally Composable Security: A New Paradigm for Cryptographic Protocols", 42nd FOCS, pp. 136-145, 2001
7. Ran Canetti, Marc Fischlin, "Universally Composable Commitments", Crypto01, Springer LNCS 2139, pp. 19-40, 2001
8. Ran Canetti, Oded Goldreich, Shai Halevi, "The Random Oracle Methodology, Revisited (Preliminary Version)", 30th STOC, pp. 209-218, 1998
9. R. Canetti, O. Goldreich, S. Goldwasser and S. Micali, "Resettable Zero-Knowledge", 32nd STOC, pp. 235-244, 2000
10. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen, "Black-box concurrent zero-knowledge requires Omega (log n) rounds", 33rd STOC, pp. 570-579, 2001
11. Ronald Cramer, Ivan Damgård, Berry Schoenmakers, "Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols", Crypto94, Springer LNCS 839, pp. 174-187, 1994
12. Y. Damgård, "Efficient Concurrent Zero-Knowledge in the Auxilliary String Model", EuroCrypt00, Springer LNCS 1807, pp 418-430, 2000
13. Cynthia Dwork, Larry J. Stockmeyer, "2-round zero knowledge and proof auditors", 34th STOC, pp 322-331, 2002
14. C. Dwork, M. Naor, A. Sahai, "Concurrent zero-knowledge ", 30th STOC pp. 409-418, 1998
15. Cynthia Dwork, Moni Naor, "Zaps and Their Applications", 40th FOCS, pp. 283-293, 2000
16. Cynthia Dwork, Moni Naor, "Pricing via Processing or Combatting Junk Mail", Crypto92, Springer LNCS 740, pp. 139-147, 1992
17. U. Feige, D. Lapidot, A. Shamir, "Multiple Noninteractive Zero Knowledge Proofs under General Assumptions", Siam J. Comput. 29(1), pp. 1-28, 1999
18. Uriel Feige, Adi Shamir, "Zero Knowledge Proofs of Knowledge in Two Rounds", Crypto89, Springer LNCS 435, pp. 526-544, 1989
19. Uriel Feige, Adi Shamir, "Witness Indistinguishable and Witness Hiding Protocols", 22nd STOC, pp. 416-426, 1990
20. O. Goldreich, "Foundations of Cryptography", Cambridge University Press, 2001
21. Oded Goldreich, Ariel Kahan, "How to Construct Constant-Round Zero-Knowledge Proof Systems for NP", Jour. of Cryptology 9(3), pp. 167-190, 1996
22. Oded Goldreich, Hugo Krawczyk, "On the Composition of Zero-Knowledge Proof Systems", SIAM J. Comput. 25(1), pp. 169-192, 1996
23. Oded Goldreich, Leonid A. Levin, "A Hard-Core Predicate for all One-Way Functions", 21st STOC, pp. 25-32, 1989
24. Oded Goldreich, Silvio Micali, Avi Wigderson, "Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems", JACM 38(3), pp. 691-729, 1991
25. Oded Goldreich, Yair Oren, "Definitions and Properties of Zero-Knowledge Proof Systems", Jour. of Cryptology 7(1), pp. 1-32, 1994
26. Shafi Goldwasser, Silvio Micali, "Probabilistic Encryption", JCSS 28(2), pp. 270-299, 1984
27. Shafi Goldwasser, Silvio Micali, Charles Rackoff, "The Knowledge Complexity of Interactive Proof Systems", SIAM J. Comput. 18(1), pp. 186-208, 1989.
28. Preliminary version in STOC 1985. Earlier versions date to 1982.
29. Louis C. Guillou, Jean-Jacques Quisquater, "A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Trasmission and Memory", EuroCrypt88, Springer LNCS 330, pp. 123-128, 1988
30. Rafael Pass, "How to Use Random Oracles Properly", Submitted.
31. Rafael Pass, "On the Limits of the Common Reference String Model, and Implications on Universal Composability", Submitted.
32. Charles Rackoff, Daniel R. Simon, "Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack", Crypto91, Springer LNCS 576, pp. 433-444, 1991
33. Ransom Richardson, Joe Kilian, "On the Concurrent Composition of Zero-Knowledge Proofs", EuroCrypt99, Springer LNCS 1592 , pp. 415-431, 1999
34. C.P. Schnorr, "Efficient Identification and Signatures for Smart Cards", Crypto89, Springer LNCS 435, pp. 235-251, 1989