Abstract
We propose a relaxation of zero-knowledge, by allowing the simulator to run in quasi-polynomial time. We show that protocols satisfying this notion can be constructed in settings where the standard definition is too restrictive. Specifically, we construct constant-round straight-line concurrent quasi-polynomial time simulatable arguments and show that such arguments can be used in advanced composition operations without any set-up assumptions. Our protocols rely on slightly strong, but standard type assumptions (namely the existence of one-to-one one-way functions secure against subexponential circuits).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Boaz Barak, “How to Go Beyond the Black-Box Simulation Barrier”, 42nd FOCS, pp. 106–115, 2001
Boaz Barak, Yehuda Lindell “Strict polynomial-time in simulation and extraction”, 34th STOC, pp. 484–493, 2002
Dan Boneh, Moni Naor, “Timed Commitments”, Crypto00, Springer LNCS 1880, pp. 236–254, 2000
Manuel Blum, “Coin Flipping by Telephone”, Crypto81, ECE Report 82-04, ECE Dept., UCSB, pp. 11–15, 1982
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
Ran Canetti, “Universally Composable Security: A New Paradigm for Cryptographic Protocols”, 42nd FOCS, pp. 136–145, 2001
Ran Canetti, Marc Fischlin, “Universally Composable Commitments”, Crypto01, Springer LNCS 2139, pp. 19–40, 2001
Ran Canetti, Oded Goldreich, Shai Halevi, “The Random Oracle Methodology, Revisited (Preliminary Version)”, 30th STOC, pp. 209–218, 1998
R. Canetti, O. Goldreich, S. Goldwasser and S. Micali, “Resettable Zero-Knowledge”, 32nd STOC, pp. 235–244, 2000
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen, “Black-box concurrent zero-knowledge requires Omega (log n) rounds”, 33rd STOC, pp. 570–579, 2001
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
Y. Damgård, “Efficient Concurrent Zero-Knowledge in the Auxilliary String Model”, EuroCrypt00, Springer LNCS 1807, pp 418–430, 2000
Cynthia Dwork, Larry J. Stockmeyer, “2-round zero knowledge and proof auditors”, 34th STOC, pp 322–331, 2002
C. Dwork, M. Naor, A. Sahai, “Concurrent zero-knowledge”, 30th STOC pp. 409–418, 1998
Cynthia Dwork, Moni Naor, “Zaps and Their Applications”, 40th FOCS, pp. 283–293, 2000
Cynthia Dwork, Moni Naor, “Pricing via Processing or Combatting Junk Mail”, Crypto92, Springer LNCS 740, pp. 139–147, 1992
U. Feige, D. Lapidot, A. Shamir, “Multiple Noninteractive Zero Knowledge Proofs under General Assumptions”, Siam J. Comput. 29(1), pp. 1–28, 1999
Uriel Feige, Adi Shamir, “Zero Knowledge Proofs of Knowledge in Two Rounds”, Crypto89, Springer LNCS 435, pp. 526–544, 1989
Uriel Feige, Adi Shamir, “Witness Indistinguishable and Witness Hiding Protocols”, 22nd STOC, pp. 416–426, 1990
O. Goldreich, “Foundations of Cryptography”, Cambridge University Press, 2001
Oded Goldreich, Ariel Kahan, “How to Construct Constant-Round Zero-Knowledge Proof Systems for NP”, Jour. of Cryptology 9(3), pp. 167–190, 1996
Oded Goldreich, Hugo Krawczyk, “On the Composition of Zero-Knowledge Proof Systems”, SIAM J. Comput. 25(1), pp. 169–192, 1996
Oded Goldreich, Leonid A. Levin, “A Hard-Core Predicate for all One-Way Functions”, 21st STOC, pp. 25–32, 1989
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
Oded Goldreich, Yair Oren, “Definitions and Properties of Zero-Knowledge Proof Systems”, Jour. of Cryptology 7(1), pp. 1–32, 1994
Shafi Goldwasser, Silvio Micali, “Probabilistic Encryption”, JCSS 28(2), pp. 270–299, 1984
Shafi Goldwasser, Silvio Micali, Charles Rackoff, “The Knowledge Complexity of Interactive Proof Systems”, SIAM J. Comput. 18(1), pp. 186–208, 1989. Preliminary version in STOC 1985. Earlier versions date to 1982.
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
Rafael Pass, “How to Use Random Oracles Properly”, Submitted.
Rafael Pass, “On the Limits of the Common Reference String Model, and Implications on Universal Composability”, Submitted.
Charles Rackoff, Daniel R. Simon, “Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack”, Crypto91, Springer LNCS 576, pp. 433–444, 1991
Ransom Richardson, Joe Kilian, “On the Concurrent Composition of Zero-Knowledge Proofs”, EuroCrypt99, Springer LNCS 1592, pp. 415–431, 1999
C.P. Schnorr, “Efficient Identification and Signatures for Smart Cards”, Crypto89, Springer LNCS 435, pp. 235–251, 1989
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 International Association for Cryptologic Research
About this paper
Cite this paper
Pass, R. (2003). Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_10
Download citation
DOI: https://doi.org/10.1007/3-540-39200-9_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14039-9
Online ISBN: 978-3-540-39200-2
eBook Packages: Springer Book Archive