Zero-knowledge proofs of knowledge without interaction

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 427-436

  De Santis, Alfredo ^a   Persiano, Giuseppe ^a,b  

^a UNIVERSITY OF SALERNO   (Italy)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

INTERACTIVE MODELING; RANDOM STRING; SECURE PROTOCOLS; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE;

COMPUTER SCIENCE;

EID: 85028462775     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267809     Document Type: Conference Paper

References (21)

1. E. Bach, How to Generate Factored Random Numbers, SIAM Journal of Computing, vol. 17, n. 2, April 1988.
2. M. Bellare and O. Goldreich, On Defining Proofs of Knowledge, to appear in Proceedings of CRYPTO '92.
3. M. Bellare and S. Goldwasser, A New Paradigm for Digital Signatures and Message Authentication Based on Non-Interactive Zero-Knowledge Proofs, in "Advances in Cryptology - CRYPTO 89", vol. 435 of "Lecture Notes in Computer Science", Springer-Verlag.
4. M. Bellare and M. Yung, Certifying Cryptographic Tools: The case of Trapdoor Permutations, to appear in Proceedings of CRYPTO '92.
5. M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero Knowledge, SIAM Journal on Computing, vol. 6, December 1991, pp. 1084-1118.
6. M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 103-112.
7. A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems, in "Advances in Cryptology - CRYPTO 87", vol. 293 of "Lecture Notes in Computer Science", Springer Verlag, pp. 52-72.
8. A. De Santis and M. Yung, Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems, in "Advances in Cryptology - CRYPTO 90", vol. 537 of "Lecture Notes in Computer Science", Springer-Verlag, pp. 366-377.
9. W. Dime and M. Hellman, New Directions in Cryptography, IEEE Trans, on Information Theory, vol. 22, n.6, 1976, pp. 644-654.
10. D. Dolev, C. Dwork, and M. Naor, Non-Malleable Cryptography, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, 1991, pp. 542-552.
11. U. Feige, A. Fiat, and A. Shamir, Zero-knowledge Proofs of Identity, Journal of Cryptology, vol. 1, 1988, pp. 77-94.
12. U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proceedings of the 22th Annual Symposium on the Theory of Computing, 1990, pp. 308-317.
13. M. Fischer, S. Micali, and C. Rackoff, A Secure Protocol for the Oblivious Transfer, Euro-crypt 1984.
14. S. Goldwasser and S. Micali, Probabilistic Encryption, Journal of Computer and System Science, vol. 28, n. 2, 1984, pp. 270-299.
15. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989, pp. 186-208.
16. O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity, and a Methodology of Cryptographic Protocol Design, Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, 1986, pp. 174-187.
17. R. Impagliazzo and S. Rudich, Limits on the Provable Consequences of One-way Permutations, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 1989, pp. 49-61.
18. S. Micali, C. Rackoff, and B. Sloan, The Notion of Security for Probabilistic Cryptosystems, SIAM Journal on Computing, vol. 17, n. 2, April 1988.
19. M. Naor and M. Yung, Public-key Cryptosystems Probably Secure Against Chosen Ciphertext Attacks, Proceedings of the 22th Annual ACM Symposium on Theory of Computing, 1990, pp. 427-437.
20. C. Rackoff and D. R. Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack, in "Advances in Cryptology -CRYPTO 91", Ed. J. Feigenbaum, vol. 576 of "Lecture Notes in Computer Science", Springer-Verlag, pp. 433-444.
21. M. Tompaand H. Woll, Random Self-Reducibility and Zero-knowledge Interactive Proofs of Possession of Information, Proceedings of 28rd Symposium on Foundations of Computer Science, 1987, pp. 472-482.