Cryptographic applications of the non-interactive metaproof and many-prover systems

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

Volumn 537 LNCS, Issue , 1991, Pages 366-377

  De Santis, Alfredo ^a,b   Yung, Moti ^b  

^a UNIVERSITY OF SALERNO   (Italy)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INTERACTIVE COMPUTER SYSTEMS; POLYNOMIAL APPROXIMATION;

CRYPTOGRAPHIC APPLICATIONS; INTRIGUING QUESTIONS; NON-INTERACTIVE PROOF; ORIGINAL SYSTEMS; POLYNOMIAL-TIME; PROOF SYSTEM; SECURITY MECHANISM; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 85028916974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38424-3_27     Document Type: Conference Paper

References (33)

1. L. Babai and S. Moran, Artkur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, Journal of Computer and System Sciences, vol. 36, 1988, pp-254-276.
2. M. Bellare and S. Goldwasser, New Paradigms for Digital Signatures and Message Authentication based on Non-interactive Zero-knowledge Proofs, Crypto 1989.
3. M. Bellare and S. Micali, Non-interactive Oblivious Transfer and Applications. Crypto 1989.
4. M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-interactive Zero-Knowledge Proof Systems, preprint.
5. 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.
6. M. Blum, How to Prove a Theorem So No One Else Can Claim It, Proceedings of the International Congress of Mathematicians, Berkeley, California, 1986, pp. 1444-1451.
7. S. A. Cook, The Complexity of Theorem-Proving Procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing, New York, pp. 151-158.
8. Y. Desmeth, Abuse-free Cryptosystems: Particularly Subliminal-Free Authentication and Signature, preprint.
9. W. Diffie and M. E. Heilman, New Directions in Cryptography, IEEE Transactions on Information Theory, vol. IT-22, no. 6, Nov. 1976, pp. 644-654.
10. A. De Santis and G. Petsiano, Public-Randomness in Public-key Cryptosystems, Euiocrypt-90.
11. A. De Santis, S. Micali, and G. Persiano, Non-interactive Zero-Knou/ledge Proof-Systems, in “Advances in Cryptology-CRYPTO 87", vol. 293 of “Lecture Notes in Computer Science”, Springer Verlag.
12. A. DeSantis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems with Preprocessing, Crypto 1988.
13. A. De Santis and M. Yung, Non-Interactive Metaproofs and Non-interactive Protocols, Manuscript.
14. S. Even, O. Goldreich, and S. Micali, On-line/Off-line Digital Signatures, Crypto 1989
15. U. Feige, D. Lapidot and A. Shamir, Multiple Non-interactive Zero Knowledge Proofs Based on a Single Random String, Foes 90.
16. D. Feige, and A. Shamir, Witness-Hiding Protocols, Proceedings of the 22th Annual ACM Symposium on Theory of Computing, 1990, announcement in Crypto-89.
17. M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NT-Completeness, W. H. Freeman fc Co., New York, 1979.
18. O. Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge, Technical Report no. 568, Technion, June 1989.
19. O. Goldreich, S. Goldwasser, and S. Micali, How to Construct Random Functions, Journal of the Association for Computing Machinery, vol. 33, no. 4, 1986, pp. 792-807.
20. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Science, vol. 28, n. 2, 1984, pp. 270-299.
21. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.
22. S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attack, SIAM Journal of Computing, vol. 17, n. 2, April 1988, pp. 281-308.
23. O. Goldreich, S. Micali, and A. Wigdeison, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proceedings of 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 174-187.
24. O. Goldreich, S. Micali, and A. Wigdeison, How to Play Any Mental Game, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, pp. 218-229.
25. J. Håstad, Pseudorandom Generation under Uniform Assumptions, Proceedings of the 22th Annual ACM Symposium on Theory of Computing, 1990.
26. R. Impagliazzo, L. Levin, and M. Luby, Pseudo-Random Generation from One-way Functions, Proceedings of 21st STOC, May 1989.
27. R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provabiy Secure as Subset Sum, Proceedings of 30th FOCS, 1989.
28. R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations, in “Advances in Cryptology-CRYPTO 87", vol. 293 of “Lecture Notes in Computer Science”, Springer Verlag pp. 40-51.
29. D. Lapidot and A. Shamir, These Proceedings.
30. M. Naor, Bit Commitment using Pseudo-randomness, Crypto 1989.
31. 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.
32. J. Rompel, One-way functions are Necessary and Sufficient for Secure Signatures, STOC 90.
33. A. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd IEEE Symp. on Foondations of Computer Science, 1982, pp. 80-91.