Abstract
“Zero-knowledge arguments” is a fundamental cryptographic primitive which allows one polynomial-time player to convince another polynomial-time player of the validity of an NP statement, without revealing any additional information in the information-theoretic sense. Despite their practical and theoretical importance, it was only known how to implement zero-knowledge arguments based on specific algebraic assumptions; basing them on a general complexity assumption was open since their introduction in 1986 [BCC, BC, CH]. In this paper, we finally show a general construction, which can be based on any one-way permutation.
We stress that our scheme is efficient: both players can execute only polynomial-time programs during the protocol. Moreover, the security achieved is on-line: in order to cheat and validate a false theorem, the prover must break a cryptographic assumption on-line during the conversation, while the verifier can not find (ever!) any information unconditionally (in the information theoretic sense).
Part of this work was done while visiting Bellcore, and part at IBM T.J. Watson Research Center.
Chapter PDF
References
Blum M., A. DeSantis, S. Micali and G. Persiano, “Non-Interactive Zero-Knowledge” SIAM J.Comp. 91
Blum M., and S. Micali “How to Generate Cryptographically Strong Sequences Of Pseudo-Random Bits” SIAM J. on Computing, Vol 13, 1984, pp. 850–864, FOCS 82.
Blum M., P. Feldman, and S. Micali “Non-Interactive Zero-Knowledge Proof Systems and Applications” STOC 88.
Bellare, M., S. Micali and R. Ostrovsky, “The (True) Complexity of Statistical Zero Knowledge” STOC 90.
Blum, M., “Coin Flipping over the Telephone,” IEEE COMPCON 1982, pp. 133–137.
J. Boyar, S. Kurtz, and M. Krental A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs, Journal of Cryptology, V. 2 N. 2, 1990, pp. 63–76, Springer International.
Bellare M., and O. Goldreich, “On Defining Proof of Knowledge,” CRYPTO 92 (this proceedings).
G. Brassard, C. Crépeau, “Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond”, FOCS 86 pp. 188–195.
G. Brassard, D. Chaum and C. Crépeau, Minimum Disclosure Proofs of Knowledge, JCSS, v. 37, pp 156–189.
Brassard G., C. Crépeau, and M. Yung, “Everything in NP can be proven in Perfect Zero Knowledge in a bounded number of rounds,” ICALP 89. (Also in TCS).
Brassard G., and M. Yung, “One-Way Group Action,” CRYPTO 90.
Chaum, D., “Demonstrating that a public predicate can be satisfied without revealing any information about how”, Crypto 86.
D. Chaum, I. Damgård and J. van de Graaf, Multiparty Computations Ensuring Secrecy of each Party’s Input and Correctness of the Output, Proc. of Crypto 87, pp. 462.
U. Feige, A. Fiat and A. Shamir, Zero-Knowledge Proofs of Identity, STOC 87, pp. 210–217.
O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness, FOCS 90.
O. Goldreich, H. Krawczyk, and M. Luby, On the Existence of Pseudo-Random Generators, FOCS 88.
S. Goldreich, S. Micali and A. Wigderson, Proofs that Yields Nothing But their Validity, FOCS 86, pp. 174–187. (also in JACM).
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, STOC 85, pp. 291–304. (also in SIAM J. COMP.)
Håstad, J., “Pseudo-Random Generators under Uniform Assumptions”, STOC 90.
I. Impagliazzo, L. Levin and M. Luby, Pseudo-random generation from one-way functions, Proc. 21st Symposium on Theory of Computing, 1989, pp. 12–24.
R. Impagliazzo and M. Luby, One-way Functions are Essential for Complexity-Based Cryptography FOCS 89, pp. 230–235.
R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset-Sum, Proc. of FOCS 89, pp. 236–241.
R. Impagliazzo and S. Rudich, On the Limitations of certain One-Way Permutations, Proc. of STOC 89, pp. 44–61.
R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computations, Proc. of Crypto 87, Springer Verlag.
A. G. Konheim, Cryptography: a primer, Wiley, New York, 1981.
M. Naor “Bit Commitment Using Pseudo-Randomness” Crypto-89 pp. 123–132.
M. Naor and M. Yung, Universal One-Way Hash Functions and their Cryptographic Applications, STOC 89.
R. Ostrovsky, R. Venkatesan, M. Yung, Fair Games Against an All-Powerful Adversary, Sequences 91, (to appear).
R. Ostrovsky, R. Venkatesan, M. Yung, Secure Commitment Against A Powerful Adversary, STACS 92, Springer Verlag LNCS, 1992.
R. Ostrovsky and A. Wigderson, One-Way Functions are Essential For Non-Trivial Zero-Knowledge Proofs, (preliminary manuscript).
J. Rompel “One-way Functions are Necessary and Sufficient for Secure Signatures” STOC 90.
M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knoweldge Interactive-Proofs of Possession of Information, Proc. of FOCS 1987.
A. C. Yao, Theory and Applications of Trapdoor functions, Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M. (1993). Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive