Upper bounds on the communication complexity of optimally resilient cryptographic multiparty computation

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

Volumn 3788 LNCS, Issue , 2005, Pages 79-99

  Hirt, Martin ^a   Nielsen, Jesper Buus ^b  

^a ETH ZURICH   (Switzerland)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTS PER GATE; COMMUNICATION COMPLEXITY; MULTIPARTY COMPUTATION; PROTOCOL EXECUTION;

BOUNDARY CONDITIONS; COMMUNICATION SYSTEMS; CRYPTOGRAPHY; NETWORK PROTOCOLS; RANDOM PROCESSES;

COMPUTATIONAL COMPLEXITY;

EID: 33646810497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_5     Document Type: Conference Paper

References (45)

1. [BB89] J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In PODC'89, p. 201-209, 1989.
2. [BCG93] M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computation (extended abstract). In 85th STOC, p. 52-61, 1993.
3. [BDPR98] M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for publickey encryption schemes. In H. Krawczyk, ed., Crypto '98, p. 26-45, 1998. LNCS 1462.
4. [Bea91a] D. Beaver. Efficient multiparty protocols using circuit randomization. In J. Feigenbaum, ed., Crypto '91, p. 420-432, 1991. LNCS 576.
5. [Bea91b] D. Beaver. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2)75-122, 1991.
6. [BFKR90] D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In A. J. Menezes and S. A. Vanstone, ed., Crypto '90, p. 62-76, 1990. LNCS 537.
7. [BGP92] P. Berman, J. A. Garay, and K. J. Perry. Optimal early stopping in distributed consensus. In Proceedings of the sixth International Workshop on Distributed Algorithms, p. 221-237, 1992.
8. [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In 20th STOC, p. 1-10, 1988.
9. [BMR90] D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In 22nd STOC, p. 503-513, 1990.
10. [Can00] R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, winter 2000.
11. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd FOCS, 2001.
12. [CCD88] D. Chaum, C. Crépeau, and I. Damgåd. Multiparty unconditionally secure protocols (extended abstract). In 80th STOC, p. 11-19, 1988.
13. +99] R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In J. Stern, ed., EuroCrypt '99, p. 311-326, 1999. LNCS 1592.
14. [CDD00] R. Cramer, I. Damgård, and S. Dziembowski. On the complexity of verifiable secret sharing and multiparty computation. In 22nd STOC, p. 325-334, 2000.
15. [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. In C. Pomerance, ed., Crypto '87, p. 87-119, 1987. LNCS 293.
16. [CDM00] R. Cramer, I. Damg&rd, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In B. Preneel, ed., EuroCrypt 8000, p. 316-334, 2000. LNCS 1807.
17. [CDN01] R. Cramer, I. Damgaard, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In EuroCrypt 2001, p. 280-300, 2001. LNCS 2045.
18. [Cra96] R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, CWI and University of Amsterdam, 1996.
19. [CW92] B. A. Coan and J. L. Welch. Modular construction of a byzantine agreement protocol with optimal message complexity. Information and Computation, 97(1):61-85, March 1992.
20. [Dam00] I. Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In B. Preneel, ed., EuroCrypt 2000, p. 418-430, 2000. LNCS 1807.
21. [DCI098] G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and non-malleable commitment. In 30th STOC, p. 141-150, 1998.
22. [DG02] I. Damgaard and J. Groth. Non-interactive and reusable non-maleable commitment schemes. In 34th STOC, 2002.
23. [DJ01] I. Damgârd and M. Jurik. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In K. Kim, ed., 4th Public Key Cryptography, p. 110-136, 2001. LNCS 1992.
24. [DN03] I. Damgârd and J. B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In D. Boneh, ed., Crypto 2003, 2003. LNCS 2729.
25. [FF00] M. Fischlin and R. Fischlin. Efficient non-malleable commitment schemes. In M. Bellare, ed., Crypto 2000, p. 414-432, 2000. LNCS 1880.
26. [FH96] M. Franklin and S. Haber. Joint encryption and message-efficient secure computation. Journal of Cryptology, 9(4):217-232, Autumn 1996.
27. [FPS00] P.-A. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Proceedings of Financial Crypto 2000, 2000.
28. [GIKR02] R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. On 2-round secure multiparty computation. In M. Yung, ed., Crypto 2002, p. 178-193, 2002. LNCS 2442.
29. [CDI05] R. Cramer, I. Damgârd, and Y. Ishai. Local conversion of secret-sharing schemes with applications to threshold cryptography. In TCC 2005, p.342-362, 2005. LNCS 3378.
30. [GL90] S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In A. J. Menezes and S. A. Vanstone, ed., Crypto '90, p. 77-93, 1990. LNCS 537.
31. [GMR85] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems (extended abstract). In 17th STOC, p. 291-304, 1985.
32. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In 19th STOC, p. 218-229, 1987.
33. [GRR98] R. Gennaro, M. Rabin, and T. Rabin. Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. In PODC'98, 1998.
34. [GV87] O. Goldreich and R. Vainish. How to solve any protocol problem - an efficiency improvement. In C. Pomerance, ed., Crypto '87, p. 73-86, 1987. LNCS 293.
35. [HM00] M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, winter 2000.
36. [HM01] M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In J. Kilian, ed., Crypto 2001, p. 101-118, 2001. LNCS 2139.
37. [HMP00] M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In T. Okamoto, ed., ASIA CRYPT 2000, p. 143-161, 2000. LNCS 1976.
38. [JJ00] M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, ed., ASIA CRYPT 2000, p. 162-177, 2000. LNCS 1976.
39. [KY02] J. Katz and M. Yung. Threshold cryptosystems based on factoring. In Y. Zheng, ed., ASIA CRYPT 2002, p. 192-205, 2002. LNCS 2501.
40. [LSP82] L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):381-401, July 1982.
41. [MR91] S. Micali and P. Rogaway. Secure computation. In J. Feigenbaum, ed., Crypto '91, p. 392-404, 1991. LNCS 576.
42. [Nie03] J. B. Nielsen. On protocol security in the cryptographic model. Dissertation Series DS-03-8, BRICS, Department of Computer Science, University of Aarhus, August 2003.
43. [Pai99] P. Paillier. Public-key cryptosystems based on composite degree residue classes. In J. Stern, ed., EuroCrypt '99, p. 223-238, 1999. LNCS 1592.
44. [RB89] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21th STOC, p. 73-85, 1989.
45. [Yao82] A. C.-C. Yao. Protocols for secure computations (extended abstract). In 23rd FOCS, p. 160-164, 1982.