Round efficient unconditionally secure multiparty computation protocol

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

Volumn 5365 LNCS, Issue , 2008, Pages 185-199

  Patra, Arpita ^a   Choudhary, Ashish ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Information theoretic security; Multiparty computation

Indexed keywords

BROADCASTING; INFORMATION THEORY;

BROADCAST CHANNEL (BC); COMMUNICATION COMPLEXITIES; COMMUNICATION OVERHEADS; INFORMATION THEORETIC SECURITY; MULTIPARTY COMPUTATION;

CRYPTOGRAPHY;

EID: 58549100326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89754-5_15     Document Type: Conference Paper

References (16)

1. Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420-432. Springer, Heidelberg (1992)
2. Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology 4(4), 75-122 (1991)
3. Beerliová-Trubíniová, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Proc. of TCC, pp. 305-328 (2006)
4. Beerliová-Trubíniová, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213-230. Springer, Heidelberg (2008)
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: STOC, pp. 1-10 (1988)
6. Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. Computer Science Research, 313-322 (1992)
7. Carter, L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences (JCSS) 18(4), 143-154 (1979)
8. Chaum, D., Crpeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proc. of FOCS 1988, pp. 11-19 (1988)
9. Cramer, R., Damgård, I.: Multiparty Computation, an Introduction. Contemporary Cryptography. Birkháuser, Basel (2005)
10. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311-326. Springer, Heidelberg (1999)
11. Damgård, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572-590. Springer, Heidelberg (2007)
12. Fitzi, M., Hirt, M.: Optimally Efficient Multi-Valued Byzantine Agreement. In: Proc. of PODC 2006, pp. 163-168. ACM, New York (2006)
13. Patra, A., Choudhary, A., Pandu Rangan, C.: Round Efficient Unconditionally Seecure Multiparty Computation. Cryptology ePrint Archive, Report 2008/399
14. Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and byzantine agreement for t ≥ n/3. Technical report, IBM Research (1996)
15. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73-85 (1989)
16. Yao, A.C.: Protocols for secure computations. In: Proc. of 23rd IEEE FOCS, pp. 160-164 (1982)