Perfect zero-knowledge arguments for NP using any one-way permutation

Journal of Cryptology

Volumn 11, Issue 2, 1998, Pages 87-108

  Naor, Moni ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141544069     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900037     Document Type: Article

References (37)

1. M. Bellare, R. Impagliazzo, and M. Naor, Does Parallel Repetition Lower the Error in Computationally Convincing Protocols?, Proc. 38th Symp. on Foundations of Computer Science, 1997, pp. 374-383.
2. M. Bellare, S. Micali, and R. Ostrovsky, The (True) Complexity of Statistical Zero Knowledge, Proc. 2\st ACM Symp. on Theory of Computing, 1990, pp. 494-502.
3. M. Blum and S. Micali, How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits, SIAMJ. Comput., vol. 13, 1984, pp. 850-864.
4. J. Boyar, S. Kurtz, and M. Krental, A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs, J. Cryplology, vol. 2,1990, pp. 63-76.
5. S. Brands, An Efficient Off-Line Electronic Cash System Based on the Representation Problem, CWl Technical Report CS-R9323, Amsterdam, 1993.
6. G. Brassard, D. Chaum, and C. Crépeau, Minimum Disclosure Proofs of Knowledge,J. Computer System Sä., vol. 37, 1988, pp. 156-189.
7. G. Brassard and M. Yung, One-Way Group Action, Advances in Cryptology-Crypto '90, Lecture Notes in Computer Science 537, Springer-Verlag, Berlin, 1991, pp. 94-107.
8. D. Chaum, E. van Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer, Advances in Cryptology-Crypto '91, Lecture Notes in Computer Science 576, Springer-Verlag, Berlin, 1992, pp. 470-484.
9. I. Damgard, Collision Free Hash Functions and Public Key Signatures Schemes, Advances in Cryptology-Eurocrypt '87, Lecture Notes in Computer Science 293, Springer-Verlag, Berlin, 1988, pp. 203-216.
10. I. Damgard, P. Landrock, and C. Pomerance, Interactive Hashing Can Simplify Zero-Knowledge Protocol Design without Complexity Assumptions, Advances in Cryptology - Crypto '93, Lecture Notes in Computer Science 773, Springer-Verlag, Berlin, 1994, pp. 100-109.
11. I. Damgard, T. Pedersen, and B. Pfitzmann, On the Existence of Statistically Hiding Bit Commitment and Fail Stop Signature, Advances in Cryptology-Crypto '93, Lecture Notes in Computer Science 773, Springer-Verlag, Berlin, 1994, pp. 250-265.
12. O. Goldreich, A Uniform Complexity Treatment of Encryption and Zero-Knowledge, J. Cryptology, vol. 6, 1993, pp. 21-53.
13. 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).
14. O. Goldreich, S. Goldwasser, and N. Linial, Fault Tolerant Computation in the Full Information Model, Siam J. Comput., to appear. Extended abstract: Proc. IEEE 32nd Symp. on Foundations of Computer Science, 1991, pp. 447-457.
15. O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness, Proc. IEEE 31 st Symp. on Foundations of Computer Science, 1990, pp. 318-326.
16. O. Goldreich, H. Krawczyk, and M. Luby, On the Existence of Pseudo-Random Generators, SIAM J. Comput., vol. 22, 1993, pp. 1163-1175.
17. O. Goldreich and L. Levin, A Hard-Core Predicate for Any One-Way Function, Proc. 21st ACM Symp. on Theory of'Computing, 1989, pp. 25-32.
18. O. Goldreich, S. Micali, and A. Wigderson, Proofs That Yield Nothing but Their Validity or All Languages in NP Have Zero Knowledge Proof Systems, J. Assoc. Comput. Mach., vol. 38, 1991, pp. 691-729.
19. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAMJ. Comput., vol. 18, 1989, pp. 186-208.
20. J. Hâstad, Pseudo-Random Generators under Uniform Assumptions, Proc. 2lstACM Symp. on Theory of Computing, 1990, pp. 395-404.
21. I. Impagliazzo, L. Levin, and M. Luby, Pseudo-Random Generation from One-Way Functions, Proc. 21 st ACM Symp. on Theory of Computing, 1989, pp. 12-24.
22. R. Impagliazzo and M. Luby, One-Way Functions Are Essential for Complexity-Based Cryptography, Proc. IEEE 30//1 Symp. on Foundations of Computer Science, 1989, pp. 230-235.
23. R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset-Sum, J. Cryplology, vol. 9, 1996, pp. 199-216.
24. R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computations, Advances in CryplologyCrypto '87, Lecture Notes in Computer Science 293, Springer-Verlag, Berlin, 1988, pp. 40-51.
25. J. Kilian, A Note on Efficient Zero-Knowledge Proofs and Arguments, Proc. 23rd ACM Symp. on Theory of Computing, 1992, pp. 723-732.
26. L. A. Levin, Average Case Complete Problems, SIAM J. Comput., vol. 15, 1986, pp. 285-286.
27. L. A. Levin, One-Way Functions and Pseudorandom Generators. Combinatorica, vol. 7, no. 4, 1987, pp. 357-363.
28. M. Luby, Pseudorandomness and its Cryptographic Applications, Princeton University Press, Princeton, 1996.
29. S. Micali, CS Proofs, Proc. IEEE 35th Symp. of Foundations of Computer Science, 1995, pp. 436-453.
30. M. Naor, Bit Commitment Using Pseudo-Randomness, J. Cryptology, vol. 4, 1991, pp. 151-158.
31. [31 ] M. Naor and M. Yung, Universal One-Way Hash Functions and Their Cryptographic Applications, Proc. 20th ACM Symp. on Theory of Computing, 1989, pp. 33-43.
32. R. Ostrovsky, R. Venkatesan, and M. Yung, Fair Games Against an All-Powerful Adversary, in Sequences '91 : Methods in Communication, Security and Computer Science, edited by R. Capocelli, A. De Santis, and U. Vaccaro, Springer-Verlag, Berlin, 1993, pp. 418-429.
33. R. Ostrovsky, R. Venkatesan, and M. Yung, Secure Commitment Against a Powerful Adversary, Proc. STACS 92, Lecture Notes in Computer Science 577, Springer-Verlag, Berlin, 1992, pp. 439-448.
34. R. Ostrovsky, R. Venkatesan, and M. Yung, Interactive Hashing Simplifies Zero-Knowledge Protocol Design, Advance in Cryptology-Eurocrypt '93, Lecture Notes in Computer Science 765, Springer-Verlag, Berlin, 1994, pp. 267-273.
35. R. Ostrovsky and A. Wigderson, One-Way Functions Are Essential for Non-Trivial Zero-Knowledge Proofs, Proc. 2nd Israeli Symp. on Theory of Computing and Systems, 1993, pp. 3-17.
36. J. Rbmpel One-Way Functions Are Necessary and Sufficient for Secure Signatures, Proc. 2lst ACM Symp. on Theory of Computing, 1990, pp. 387-394.
37. A. C. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd Symp. on the Foundation of Computer Science, 1982, pp. 80-91.