Robust multiparty computation with linear communication complexity

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

Volumn 4117 LNCS, Issue , 2006, Pages 463-482

  Hirt, Martin ^a   Nielsen, Jesper Buus ^b  

^a ETH ZURICH   (Switzerland)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ROBUSTNESS (CONTROL SYSTEMS); SECURITY OF DATA;

CRYPTOGRAPHIC MODELS; LINEAR COMMUNICATION COMPLEXITY; MULTIPARTY COMPUTATION;

NETWORK PROTOCOLS;

EID: 33749561443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_28     Document Type: Conference Paper

References (30)

1. [BB89] J.Bar-Ilan and D.Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. PODC'89, 1989.
2. [Bea91a] D.Beaver. Efficient multiparty protocols using circuit randomization. In Crypto'91, LNCS 576, 1991.
3. [Bea91b] D.Beaver. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2):75-122, 1991.
4. [BFKR90] D.Beaver, J.Feigenbaum, J.Kilian, and P.Rogaway. Security with low communication overhead (extended abstract). Crypto'90, LNCS 537, 1990.
5. [BGW88] M.Ben-Or, S.Goldwasser, and A.Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). 20th STOC, 1988.
6. [BH05] Z.Beerliova-Trubiniova and M.Hirt. Efficient multi-party computation with dispute control. TCC'06, LNCS 3876, 2006.
7. [BMR90] D.Beaver, S.Micali, and P.Rogaway. The round complexity of secure protocols (extended abstract). 22nd STOC, 1990.
8. [Can01] R.Canetti. Universally composable security: A new paradigm for cryptographic protocols. 42nd FOCS, 2001.
9. [CCD88] D.Chaum, C.Crépeau, and I.Damgård. Multiparty unconditionally secure protocols (extended abstract). 20th STOC, 1988.
10. [CDD+99] R.Cramer, I.Damgård, S.Dziembowski, M.Hirt, and T.Rabin. Efficient multiparty computations secure against an adaptive adversary. EuroCrypt'99, LNCS 1592, 1999.
11. [CDD00] R.Cramer, I.Damgård, and S.Dziembowski. On the complexity of verifiable secret sharing and multiparty computation. 32nd STOC, 2000.
12. [CDG87] D.Chaum, I.Damgård, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. Crypto'87, LNCS 293, 1987.
13. [CDM00] R.Cramer, I.Damgård, and U.Maurer. General secure multi-party computation from any linear secret-sharing scheme. EuroCrypt'00, LNCS 1807, 2000.
14. [CDN01] R.Cramer, I.Damgaard, and J.B.Nielsen. Multiparty computation from threshold homomorphic encryption. EuroCrypt'01, LNCS 2045, 2001.
15. [Dam00] I.Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. EuroCrypt'00, LNCS 1808, 2000.
16. [DI06] I.Damgård and Y.Ishai. Scalable secure multiparty computation. Crypto'06, 2006.
17. [FH06] M.Fitzi and M.Hirt. Optimally efficient multi-valued byzantine agreement. 25th PODC, 2006.
18. [FH96] M.Franklin and S.Haber. Joint encryption and message-efficient secure computation. Journal of Cryptology, 9(4):217-232, 1996.
19. [GMW87] O.Goldreich, S.Micali, and A.Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. 19th STOC, 1987.
20. [GRR98] R.Gennaro, M.Rabin, and T.Rabin. Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. PODC'98, 1998.
21. [GV87] O.Goldreich and R.Vainish. How to solve any protocol problem - an efficiency improvement. Crypto'87, LNCS 293, 1987.
22. [HM01] M.Hirt and U.Maurer. Robustness for free in unconditional multi-party computation. Crypto'01, LNCS 2139, 2001.
23. [HMP00] M.Hirt, U.Maurer, and B.Przydatek. Efficient secure multi-party computation. Asiacrypt'00, LNCS 1976, 2000.
24. [HN05] M.Hirt and J.B.Nielsen. Upper bounds on the communication complexity of optimally resilient cryptographic multiparty computation. Asiacrypt'05, LNCS 3788, 2005
25. [HNP05] M.Hirt, J.B.Nielsen, and B.Przydatek. Cryptographic asynchronous multi-party computation with optimal resilience. EuroCrypt'05, LNCS 3494, 2005.
26. [Nie03] J.B.Nielsen. On Protocol Security in the Cryptographic Model. PhD Thesis. Department of Computer Science, University of Aarhus, 2003.
27. [Pai99] P.Paillier. Public-key cryptosystems based on composite degree residue classes. EuroCrypt'99, LNCS 1592, 1999.
28. [Rab98] T.Rabin. A simplified approach to threshold and proactive RSA. Crypto'98, LNCS 1462, 1998.
29. [RB89] T.Rabin and M.Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. 21th STOC, 1989.
30. [Yao82] A. C.-C. Yao. Protocols for secure computations (extended abstract). 23rd FOCS, 1982.