Efficient asynchronous secure multiparty distributed computation

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

Volumn 1977, Issue , 2000, Pages 117-129

  Srinathan, K ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACTIVE ADVERSARY; ASYNCHRONOUS PROTOCOLS; DISTRIBUTED COMPUTATIONS; MESSAGE COMPLEXITY; SECURE COMPUTATION;

CRYPTOGRAPHY;

EID: 84947784853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44495-5_11     Document Type: Conference Paper

References (19)

1. Judit Bar-Ilan and Donald Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proceedings of 8th ACM PODC, pages 201–210, August 1989. 118
2. Donald Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pages 75–122, 1991.117
3. Donald Beaver, Joan Feigenbaum, Joe Kilian, and Phillip Rogaway. Security with low communication overhead (extended abstract). In CRYPTO’90, pages 62–76, 1990.118
4. Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols(extended abstract). In Proceedings of 22nd ACM STOC, pages 503–513, 1990.118
5. M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computations. In Proceedings of 25th ACM STOC, pages 52–61, 1993.117, 117, 118, 118, 118, 118, 118, 120, 121, 121, 121, 122, 122, 126, 126, 129
6. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proceedings of 20th ACM STOC, pages 1–10, 1988.117, 120
7. M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computation with optimal resilience. In Proceedings of 13th ACM PODC, pages 183–192, 1994.117, 118, 118, 120, 121, 121
8. G. Bracha. An asynchronous _(n − 1)/3_-resilient consensus protocol. In Proceedings of 3rd ACM PODC, pages 154–162, 1984.119
9. R. Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, The Weizmann Institute of Science, June 1995.118
10. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure computation. In Proceedings of 28th ACM STOC, 1996.117
11. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of 20th ACM STOC, pages 11–19, 1988.117
12. R. Cramer, I. Damgard, and U. Maurer. Efficient general secure multiparty computation from any linear secret sharing scheme. In EUROCRYPT2000. Springer-Verlag, 2000.121, 122
13. Ronald Cramer, Ivan Damgard, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT’99. Springer-Verlag, 1999.117
14. Matthew K. Franklin and Moti Yung. Communication complexity of secure computation. In Proceedings of 24th ACM STOC, pages 699–710, 1992.118
15. Rosario Gennaro, Micheal O. Rabin, and Tal Rabin. Simplified VSS and fasttrack multiparty computations with applications to threshold cryptography. In Proceedings of 17th ACM PODC, 1998.118, 123, 124
16. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th ACM STOC, pages 218–229. ACM Press, 1987.117
17. Martin Hirt, Ueli Maurer, and Bartosz Przydatek. Efficient multi-party computation. In ASIACRYPT 2000. Springer-Verlag, December 2000.118, 118, 119, 120
18. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of 21st ACM STOC, pages 73–85, 1989.117
19. A. Shamir. How to share a secret. CACM, 22:612–613, 1979.120