Necessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all NP relations

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

Volumn 1853, Issue , 2000, Pages 451-462

  De Santis, Alfredo ^a   Di Crescenzo, Giovanni ^b   Persiano, Giuseppe ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS; PUBLIC KEY CRYPTOGRAPHY;

COMMITMENT SCHEME; COMPUTATIONAL PROBLEM; CRYPTOGRAPHIC PROTOCOLS; NATURAL CONDITIONS; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; PUBLIC KEY CRYPTOSYSTEMS;

AUTOMATA THEORY;

EID: 84974625311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_38     Document Type: Conference Paper

References (28)

1. E. Bach, How to Generated Random Factored numbers, SIAM Journal on Computing, vol. 17, n. 2, 1988.
2. E. Bach and J. Shallit, Algorithmic Number Theory, MIT Press, 1996.
3. D. Beaver, Adaptive Zero-Knowledge and Computational Equivocation, in Proc. Of FOCS 96.
4. M. Bellare and S. Goldwasser, Methodology for Constructing Signature Schemes based on Non-Interactive Zero-Knowledge Proofs, in Proc. Of CRYPTO 88.
5. M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero- Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084-1118.
6. M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proc. Of STOC 88.
7. M. Blum and S. Micali, How to Generate Cryptographically Strong Sequence of Pseudo-Random Bits, SIAM J. on Computing, vol. 13, no. 4, 1984, pp. 850-864.
8. G. Brassard, C. Crépeau, and D. Chaum, Minimum Disclosure Proofs of Knowledge, Journal of Computer and System Sciences, vol. 37, no. 2, pp. 156-189.
9. W. Diffie and M. Hellman, New Directions in Cryptography, in IEEE Transaction in Information Theory, 22, 1976.
10. A. De Santis and P. Persiano, Zero-Knowledge Proofs of Knowledge without Interaction, in Proc. Of FOCS 92.
11. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky, Non-Interactive and Non-Malleable Commitment, in Proc. Of STOC 98.
12. G. Di Crescenzo and R. Ostrovsky, On Concurrent Zero-Knowledge with Pre-Processing, in Proc. Of CRYPTO 99.
13. U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, in Proc. Of STOC 90.
14. O. Goldreich, S. Goldwasser, and S. Micali, How to Construct Random Functions, Journal of the ACM, vol. 33, no. 4, 1986, pp. 792-807.
15. O. Goldreich and L. Levin, A Hard-Core Predicate for any One-Way Function, in Proc. Of FOCS 90.
16. O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, vol. 38, n. 1, 1991, pp. 691-729.
17. S. Goldwasser, and S. Micali, Probabilistic Encryption, Journal of Computer and System Sciences, vol. 28, n. 2, 1984, pp. 270-299.
18. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, 1989.
19. J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a Pseudo- Random Generator from any One-Way Function, SIAM Journal on Computing, vol. 28, n. 4, pp. 1364-1396, 1999.
20. R. Impagliazzo and M. Luby, One-Way Functions are Necessary for Complexity- Based Cryptography, in Proc. Of FOCS 89.
21. R. Impagliazzo and S. Rudich, Limits on the Provable Consequences of One-Way Permutations, in Proc. Of STOC 91.
22. M. Luby and C. Rackoff, How to Construct a Pseudo-Random Permutation from a Pseudo-Random Function, in SIAM Journal on Computing, vol. 17, n.2, Aug 1988.
23. M. Naor, Bit Commitment using Pseudorandomness, in Proc. Of CRYPTO 91.
24. M. Naor and M. Yung, Universal One-way Hash Functions and their Cryptographic Applications, in Proc. Of STOC 89.
25. M. Naor and M. Yung, Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attack, Proc. Of STOC 90.
26. R. Ostrovsky and A. Wigderson, One-way Functions are Necessary for Non-Trivial Zero-Knowledge Proofs, in Proc. Of ISTCS 93.
27. J. Rompel, One-way Functions are Necessary and Sufficient for Secure Signatures, in Proc. Of STOC 90.
28. A. Yao, Theory and Applications of Trapdoor Functions, in Proc. Of FOCS 82.