Perfect zero-knowledge arguments for NP can Be based on general complexity assumptions

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

Volumn 740 LNCS, Issue , 1993, Pages 196-214

  Naor, Moni ^a   Ostrovsky, Rafail ^b,d   Venkatesan, Ramarathnam ^c   Yung, Moti ^d  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TELCORDIA TECHNOLOGIES   (United States)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BERYLLIUM COMPOUNDS; INFORMATION THEORY; POLYNOMIAL APPROXIMATION;

COMPLEXITY ASSUMPTIONS; CRYPTOGRAPHIC ASSUMPTIONS; CRYPTOGRAPHIC PRIMITIVES; ONE-WAY PERMUTATION; PERFECT ZERO-KNOWLEDGE; POLYNOMIAL-TIME; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 84958615425     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48071-4_14     Document Type: Conference Paper

References (33)

1. Blum M., A. DeSantis, S. Micali and G. Persiano, “Non-Interactive Zero- Knowledge” SIAM J. Comp. 91
2. 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.
3. Blum M., P. Feldman, and S. Micali “Non-Interactive Zero-Knowledge Proof Systems and Applications” STOC 88.
4. Bellare, M., S. Micali and R. Ostrovsky, “The (True) Complexity of Statistical Zero Knowledge” STOC 90.
5. Blum, M., “Coin Flipping over the Telephone,” IEEE COMPCON 1982, pp. 133-137.
6. 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.
7. Bellare M., and O. Goldreich, “On Defining Proof of Knowledge” CRYPTO 92 (this proceedings).
8. 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.
9. G. Brassard, D. Chaum and C. Crépeau, Minimum Disclosure Proofs of Knowledge, JCSS, v. 37, pp 156-189.
10. 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).
11. Brassard G., and M. Yung, “One-Way Group Action,” CRYPTO 90.
12. Chaum, D., “Demonstrating that a public predicate can be satisfied without revealing any information about how”, Crypto 86.
13. D. Chaum, I. Damgard 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.
14. U. Feige, A. Fiat and A. Shamir, Zero-Knowledge Proofs of Identity, STOC 87, pp. 210-217.
15. O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness, FOCS 90.
16. O. Goldreich, H. Krawczyk, and M. Luby, On the Existence of Pseudo- Random Generators, FOCS 88.
17. S. Goldreich, S. Micali and A. Wigderson, Proofs that Yields Nothing But their Validity, FOCS 86, pp. 174-187. (also in JACM).
18. S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, STOC 85, pp. 291-304. (also in SIAM J. COMP.)
19. Håstad, J., “Pseudo-Random Generators under Uniform Assumptions”, STOC 90.
20. 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.
21. R. Impagliazzo and M. Luby, One-way Functions are Essential for Complexity-Based Cryptography FOCS 89, pp. 230-235.
22. R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset-Sum, Proc. of FOCS 89, pp. 236-241.
23. R. Impagliazzo and S. Rudich, On the Limitations of certain One-Way Permutations, Proc. of STOC 89, pp. 44-61.
24. R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computations, Proc. of Crypto 87, Springer Verlag.
25. A. G. Konheim, Cryptography: a primer, Wiley, New York, 1981.
26. M. Naor “Bit Commitment Using Pseudo-Randomness” Crypto-89 pp. 123-132.
27. M. Naor and M. Yung, Universal One-Way Hash Functions and their Cryptographic Applications, STOC 89.
28. R. Ostrovsky, R. Venkatesan, M. Yung, Fair Games Against an All-Powerful Adversary, Sequences 91, (to appear).
29. R. Ostrovsky, R. Venkatesan, M. Yung, Secure Commitment Against A Powerful Adversaryf STACS 92, Springer Verlag LNCS, 1992.
30. R. Ostrovsky and A. Wigderson, One-Way Functions are Essential For Non- Trivial Zero-Knowledge Proofs, (preliminary manuscript).
31. J. Rompel “One-way Functions are Necessary and Sufficient for Secure Signatures” STOC 90.
32. M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knoweldge Interactive-Proofs of Possession of Information, Proc. of FOCS 1987.
33. A. C. Yao, Theory and Applications of Trapdoor functions, Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp 80-91.