Abstract
An interactive proof system (or argument) (P, V) is concurrent zero-knowledge if whenever the prover engages in polynomially many concurrent executions of (P, V), with (possibly distinct) colluding polynomial time bounded verifiers V 1.....,V poly(n), the entire undertaking is zero-knowledge. Dwork, Naor, and Sahai recently showed the existence of a large class of concurrent zero-knowledge arguments, including arguments for all of NP, under a reasonable assumption on the behavior of clocks of nonfaulty processors. In this paper, we continue the study of concurrent zero-knowledge arguments. After observing that, without recourse to timing, the existence of a trusted center considerably simplifies the design and proof of many concurrent zero-knowledge arguments (again including arguments for all of NP), we design a preprocessing protocol, making use of timing, to simulate the trusted center for the purposes of achieving concurrent zero-knowledge. Once a particular prover and verifier have executed the preprocessing protocol, any polynomial number of subsequent executions of a rich class of protocols will be concurrent zero-knowledge.
Most of this work performed while at the IBM Ahnaden Research Center. Also supported by a DOD NDSEG doctoral fellowship, and DARPA grant DABT-96-C-0018.
Chapter PDF
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
M. Bellare and P. Rogaway, Provably Secure Session Key Distribution — The Three Party Case, Proc. 27th STOC, 1995, pp 57–64.
M. Bellare and M. Yung. Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation, Journal of Cryptology, 9(3): 149–166, 1996.
M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In Allen Gersho, editor, Advances in Cryptology: A Report on CRYPTO 81, pages 11–15, 24–26 August 1981. Department of Electrical and Computer Engineering, U.C. Santa Barbara, ECE Report 82-04, 1982.
M. Blum, A. De Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge, SIAM Journal on Computing, 20(6):1084–1118, 1991.
Blum M., P. Feldman and S. Micali, Non-Interactive Zero-Knowledge Proof Systems, Proc. 20th ACM Symposium on the Theory of Computing, Chicago, 1988, pp 103–112.
G. Brassard, C. Crepeau and M. Yung, Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. Theoretical Computer Science 84, 1991.
G. Brassard, D. Chaum, C. Crepeau, Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, 1988, pp. 156–189.
S. Brands and D. Chaum, Distance-Bounding Protocols Advances in Cryptology — EUROCRYPT'93, 1993.
R. Canetti, C. Dwork, M. Naor, R. Ostrovsky, Deniable Encryption, “Security in Communication Networks” workshop, Amain, Italy 1996 and CRYPTO'97
D. Chaum and H. van Antwerpen, Undeniable Signatures, Advances in Cryptology-CRYPTO '89, G. Brassard (Ed.), Springer-Verlag, pp. 212–216.
R. Cramer and I. Damgard New Generation of Secure and Practical RSA-Based Signatures, Advances in Cryptology-CRYPTO '96. Springer-Verlag, 1996.
A. De Santis and M. Yung. Cryptographic Applications of the Metaproof and Many-prover Systems, Proc. CRYPTO'90, Springer-Verlag, 1990.
D. Dolev, C. Dwork and M. Naor, Non-malleable Cryptography, Preliminary version: Proc. 21st STOC, 1991. Full version: submitted for publication (available from the authors).
C. Dwork and M. Naor, Pricing via Processing-or-Combatting Junk Mail, Advances in Cryptology — CRYPTO'92, Lecture Notes in Computer Science
C. Dwork and M. Naor, Method for message authentication from non-malleable crypto systems, US Patent No. 05539826, issued Aug. 29th 1996.
C. Dwork, M. Naor, and A. Sahai, Concurrent Zero Knowledge, to appear, STOC'98
U. Feige, A. Fiat and A. Shamir, Zero Knowledge Proofs of Identity, J. of Cryptology 1 (2), pp 77–94. (Preliminary version in STOC 87).
U. Feige and A. Shamir, Witness Indistinguishable and Witness Hiding Protocols Proc. 22nd STOC, 1990, pp. 416–426.
U. Feige and A. Shamir, Zero Knowledge Proofs of Knowledge in Two Rounds, Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
U. Feige, D. Lapidot and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proceedings of 31st Symposium on Foundations of Computer Science, 1990, pp. 308–317.
O. Goldreich, Foundations of Cryptography (Fragments of a Book), 1995. Electronic publication: http://www.eccc.uni-trier.de/eccc/info/ECCC-Books/eccc-books.html (Electronic Colloquium on Computational Complexity).
O. Goldreich and H. Krawczyk. On the Composition of Zero Knowledge Proof Systems. SIAM J. on Computing, Vol. 25, No. 1, pp. 169–192, 1996.
S. Goldwasser and S. Micali. Probabilistic Encryption, Journal of Computer and System Sciences, Vol. 28, April 1984, pp. 270–299.
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, Vol. 18, 1 (1989), pp. 186–208.
J. Killian, E. Petrank, and C. Rackoff, Zero Knowledge on the Internet. Manuscript, 1998.
M. Naor, Bit Commitment Using Pseudo-Randomness, Journal of Cryptology, vol 4, 1991, pp. 151–158.
C. Rackoff and D. Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Cipherext Attack, Proc. CRYPTO'91, Springer-Verlag, 1992, pp. 433–444
R. Richardson and J. Killian. Non-Synchronized Composition of Zero-Knowledge Proofs. Manuscript, 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dwork, C., Sahai, A. (1998). Concurrent zero-knowledge: Reducing the need for timing constraints. In: Krawczyk, H. (eds) Advances in Cryptology — CRYPTO '98. CRYPTO 1998. Lecture Notes in Computer Science, vol 1462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055746
Download citation
DOI: https://doi.org/10.1007/BFb0055746
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64892-5
Online ISBN: 978-3-540-68462-6
eBook Packages: Springer Book Archive