Non-interactive zero-knowledge with preprocessing

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

Volumn 403 LNCS, Issue , 1990, Pages 269-282

  De Santis, Alfredo ^a,d   Micali, Silvio ^b   Persiano, Giuseppe ^c  

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

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HARVARD UNIVERSITY   (United States)

^d UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY ASSUMPTIONS; ENCRYPTION SCHEMES; MODIFIED MODEL; NON-INTERACTIVE ZERO KNOWLEDGE; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; PROBABILISTIC ENCRYPTION; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 33745125579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/0-387-34799-2_21     Document Type: Conference Paper

References (12)

1. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Mi-cali, and P. Rogaway, Everything Provable is Provable in Zero-Knowledge, CRYPTO 88.
2. M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge Proof Systems and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, 1988, pp. 103-112.
3. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo random bits, SIAM Journal on Computing, vol. 13, n. 4, November 1984, pp. 850-864.
4. A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, in “Advances in Cryptology -CRYPTO 87 Proceedings”, pp. 52-72, vol. 293 of “Lecture Notes in Computer Science”, Springer Verlag.
5. S. Goldwasser and S. Micali, Probabilistic Encryption, Journal of Computer and System Science, vol. 28, n. 2, 1984, pp. 270-299.
6. S. Goldwasser, S. Micali and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attack, SIAM Journal on Computing, vol. 17, n. 2, April 1988, pp. 281-308.
7. M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman k Co., New York, 1979.
8. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, RI, May 1985, pp. 291-304.
9. 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 Annual Symposium on Foundations of Computer Science, October 1986, pp. 174-187.
10. S. Micali, C. Rackoff, and B. Sloan, The Notion of Security for Probabilistic Cryptosystems, SIAM Journal on Computing, vol. 17, n. 2, April 1988, pp. 412-426.
11. C. E. Shannon, Communication Theory of Secrecy Systems, Bell System Tech. J., vol. 28, Oct. 1949, pp. 656-715.
12. A. C. Yao, Theory and Applications of Trapdoor Functions, Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science, 1982, pp. 80-91.