Foundations of secure interactive computing

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

Volumn 576 LNCS, Issue , 1992, Pages 377-391

  Beaver, Donald ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; CRYPTOGRAPHY;

BYZANTINE AGREEMENT; CIRCUIT EVALUATION; INTERACTIVE COMPUTATION; INTERACTIVE COMPUTING; OBLIVIOUS TRANSFER; SECURE MULTI-PARTY COMPUTATION; SECURITY AND RELIABILITIES; ZERO KNOWLEDGE PROOF;

RELIABILITY;

EID: 85029542707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46766-1_31     Document Type: Conference Paper

References (27)

1. M. Abadi, J. Feigenbaum, J. Kilian. “On Hiding Information from an Oracle.” J. Comput. System Sci. 39 (1989), 21-50.
2. D. Beaver. “Secure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority.” To appear, J. Cryptology. An earlier version appeared as “Secure Multiparty Protocols Tolerating Half Faulty Processors.” Proceedings of Crypto 1989, ACM, 1989.
3. D. Beaver. “Formal Definitions for Secure Distributed Protocols.” Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.).
4. D. Beaver. Security, Fault Tolerance, and Communication Complexity in Distributed Systems. PhD Thesis, Harvard University, Cambridge, 1990.
5. D. Beaver, S. Goldwasser. “Multiparty Computation with Faulty Majority.” Proceedings of the 30 th FOCS, IEEE, 1989, 468-473.
6. D. Beaver, S. Haber. “Cryptographic Protocols Provably Secure Against Dynamic Adversaries.” Submitted to FOCS 91.
7. D. Beaver, S. Micali, P. Rogaway. “The Round Complexity of Secure Protocols.” Proceedings of the 22st STOC, ACM, 1990, 503-513.
8. M. Ben-Or, S. Goldwasser, A. Wigderson. “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.” Proceedings of the 20th STOC, ACM, 1988, 1-10.
9. R. Blakley. “Security Proofs for Information Protection Systems.” Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society Press, New York, 1981, 79-88.
10. G. Brassard, D. Chaum, C. Crépeau. “Minimum Disclosure Proofs of Knowledge.” J. Comput. System Sci. 37 (1988), 156-189.
11. th STOC, ACM, 1988, 11-19.
12. Z. Galil, S. Haber, M. Yung. “Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model.” Proceedings of Crypto 1987, Springer-Verlag, 1988, 135-155.
13. Z. Galil, S. Haber, and M. Yung. “Minimum-Knowledge Interactive Proofs for Decision Problems.” SIAM J. Comput. 18: 4 (1989), 711-739.
14. S. Goldwasser, L. Levin. “Fair Computation of General Functions in Presence of Immoral Majority.” Proceedings of Crypto 1990.
15. S. Goldwasser, S. Micali. “Probabilistic Encryption.” J. Comput. System Sci. 28 (1984), 270-299.
16. S. Goldwasser, S. Micali, C. Rackoff. “The Knowledge Complexity of Interactive Proof Systems.” SIAM J. Comput. 18: 1 (1989), 186-208.
17. th STOC, ACM, 1986, 59-68.
18. O. Goldreich, S. Micali, A. Wigderson. “Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design.” Proceedings of the 27th FOCS, IEEE, 1986, 174-187.
19. O. Goldreich, S. Micali, A. Wigderson. “How to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority.” Proceedings of the 19th STOC, ACM, 1987, 218-229.
20. S. Haber. Multi-Party Cryptographic Computation: Techniques and Applications, PhD Thesis, Columbia University, 1988.
21. S. Micali, P. Rogaway. “The Notion of Secure Computation.” Unpublished Manuscript, 1990.
22. S. Micali, P. Rogaway. “Secure Computation.” These Proceedings (Crypto 1991), page 9.8.
23. Y. Oren. “On the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs.” Proceedings of the 19th STOC, ACM, 1987, 462-471.
24. T. Rabin, M. Ben-Or. “Verifiable Secret Sharing and Multiparty Protocols with Honest Majority.” Proceedings of the 21st STOC, ACM, 1989, 73-85.
25. A. Shamir. “How to Share a Secret.” Communications of the ACM, 22 (1979), 612-613.
26. A. Yao, “Theory and Applications of Trapdoor Functions.” Proceedings of the 23rd FOCS, IEEE, 1982, 80-91.
27. A. Yao. “How to Generate and Exchange Secrets.” Proceedings of the 27th FOCS, IEEE, 1986, 162-167.