Simple and efficient perfectly-secure asynchronous MPC

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

Volumn 4833 LNCS, Issue , 2007, Pages 376-392

  Beerliova Trubiniova, Zuzana ^a   Hirt, Martin ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Asynchronous; Efficiency; Hybrid model; Multi party computation; Perfect security

Indexed keywords

CRYPTOGRAPHY; ERROR ANALYSIS; FUNCTIONS; MATHEMATICAL MODELS;

COMMUNICATION COMPLEXITY; HYBRID MODEL; MULTI-PARTY COMPUTATION;

COMPUTATION THEORY;

EID: 38349009076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76900-2_23     Document Type: Conference Paper

References (20)

1. Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proc. 25th STOC, pp. 52-61 (1993)
2. Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 75-122 (1991)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th STOC, pp. 1-10 (1988)
4. Beerliova-Trubiniova, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305-328. Springer, Heidelberg (2006)
5. Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Proc. 13th PODC, pp. 183-192 (1994)
6. Bracha, G.: An asynchronous [(n - 1)/3]-resilient consensus protocol. In: Proc. 3rd PODC, pp. 154-162 (1984)
7. Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (June 1995)
8. Chaum, D., Crépeau, C., Damgård, L: Multiparty unconditionally secure protocols (extended abstract). In: Proc. 20th STOC, pp. 11-19 (1988)
9. Chaum, D., Damgård, I., van de Graaf, J.: Multiparty computations ensuring privacy of each party's input and correctness of the result. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 87-119. Springer, Heidelberg (1988)
10. Damgård, I., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: CRYPTO 2007. LNCS, vol. 4622, Springer, Heidelberg (2007)
11. Galil, Z., Haber, S., Yung, M.: Cryptographic computation: Secure fault-tolerant protocols and the public-key model. In: Pomeranèe, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 135-155. Springer, Heidelberg (1988)
12. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: Proc. 19th STOC, pp. 218-229 (1987)
13. Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143-161. Springer, Heidelberg (2000)
14. Hirt, M., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 463-482. Springer, Heidelberg (2006)
15. Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience. In: Cramer, R.J.F. (ed.) EU-ROCRYPT 2005. LNCS, vol. 3494, pp. 322-340. Springer, Heidelberg (2005)
16. Prabhu, B., Srinathan, K., Rangan, C.P.: Asynchronous unconditionally secure computation: An efficiency improvement. In: Menezes, A.J., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, Springer, Heidelberg (2002)
17. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. 21st STOC, pp. 73-85 (1989)
18. Shamir, A.: How to share a secret. Communications of the ACM 22, 612-613 (1979)
19. Srinathan, K., Rangan, C.P.: Efficient asynchronous secure multiparty distributed computation. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, Springer, Heidelberg (2000)
20. Yao, A.C.: Protocols for secure computations. In: Proc. 23rd FOCS, pp. 160-164 (1982)