Communication complexity of secure computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 699-710

  Franklin, Matthew ^a   Yung, Moti ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; ERROR CORRECTION; ERROR DETECTION; ERRORS; FAULT TOLERANCE; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROGRAM COMPILERS; SECURITY OF DATA;

COMMUNICATION COMPLEXITY; COMPILATION TECHNIQUES; CRYPTOGRAPHIC PROTOCOLS; DISTRIBUTED COMPUTATIONS; FAULT TOLERANT PROTOCOLS; FAULT-TOLERANCE MODELS; UNCONDITIONALLY SECURE; UPPER AND LOWER BOUNDS;

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY;

BOUNDS; COMMUNICATION COMPLEXITY; DIRECT SUM PROBLEMS; MULTI SECRET SHARING; PRIVACY MODEL; SECURE DISTRIBUTED COMPUTATION;

EID: 0026985378     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129780     Document Type: Conference Paper

References (19)

1. J. Bar-Han and D. Beaver, "Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction," ACM PODC 1989, pp. 201-209.
2. R. Bar-Yehuda, B. Chor, and E. Kushilevitz, "Privacy, additional information, and communication," IEEE Structure in Complexity Theory 1990, pp. 55-65.
3. D. Beaver, "Multiparty protocols tolerating half faulty processors," Crypto 1989, pp. 560-572.
4. D.Beaver, "Foundations of secure interactive computing," Crypto 1991.
5. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, "Security with low communication overhead," Crypto 1990, pp. 62-76.
6. M. Ben-Or, S. Goldwasser, and A. Wigder-son, "Completeness theorems for noncrypto-graphic fault tolerant distributed computation," ACM STOC 1988, pp. 1-9.
7. D. Chaurn, C. Crépeau, and I. Damgárd, "Multiparty unconditionally secure protocols," ACM STOC 1988, pp. 11-19.
8. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, "Verifiable Secret Sharing" IEEE FOCS 1985, pp. 383-395.
9. D. Dolev, C. Dwork, O. Waarts, and M. Yung, "Secret Message Transmissions," IEEE FOCS 1990, pp. 36-45.
10. T. Feder, E. Kushilevitz, and M. Naor, "Amortized communication complexity," IEEE FOCS 1991, pp. 239-248.
11. O. Goldreich, S. Micali, and A. Wigder-son, "How to play any mental game," ACM STOC 1987, pp. 218-229.
12. E. Kushilevitz, "Privacy and communication complexity," IEEE FOCS 1989, pp. 416-421.
13. E. Kushilevitz, "On computing the sum privately," manuscript.
14. S. Micali and P. Rogaway, "Secure computation," Crypto 1991.
15. A. Orlitsky and A. El Gamal, "Communication with secrecy constraints," ACM STOC 1984, pp. 217-224.
16. T. Rabin and M. Ben-Or, "Verifiable secret sharing and multiparty protocols with honest majority," STOC 1989, pp. 73-85.
17. A. Shamir, "How to Share a Secret," CACM 22 (1979), 612-613.
18. C. Small, Arithmetic of Finite Fields, Monographs and Textbooks in Pure and Applied Mathematics (Vol. 148), Marcel Dekker, Inc., New York, 1991.
19. A. Yao, "How to generate and exchange secrets," IEEE FOCS 1986, pp. 162-167.