Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience

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

Volumn 6055 LNCS, Issue , 2010, Pages 184-202

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

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Multiparty computation; Verifiable secret sharing

Indexed keywords

ASYNCHRONOUS NETWORKS; BYZANTINE AGREEMENT; COMMUNICATION COMPLEXITY; COMMUNICATION COST; COMPUTING POWER; DISTINCT POINTS; FINITE FIELDS; MAXIMUM VALUES; MULTIPARTY COMPUTATION; OPTIMAL RESILIENCE; TWO PHASE; VERIFIABLE SECRET SHARING;

COMMUNICATION; COSTS; CRYPTOGRAPHY; IMAGE QUALITY; MODEL PREDICTIVE CONTROL; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 77953525112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12678-9_12     Document Type: Conference Paper

References (25)

1. Beerliová-Trubíniová, 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)
2. Beerliová-Trubíniová, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 376-392. Springer, Heidelberg (2007)
3. 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)
4. Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52-61 (1993)
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: STOC, pp. 1-10 (1988)
6. BenOr, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: PODC, pp. 183-192 (1994)
7. Bracha, G.: An asynchronous ⌊(n - 1)/3⌋-resilient consensus protocol. In: PODC, pp. 154-162 (1984)
8. Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (1995)
9. Canetti, R., Rabin, T.: Fast asynchronous Byzantine Agreement with optimal resilience. In: STOC, pp. 42-51 (1993)
10. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11-19 (1988)
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. Franklin, M.K., Yung, M.: Communication complexity of secure computation. In: STOC, pp. 699-710 (1992)
13. Feldman, P., Micali, S.: An optimal algorithm for synchronous Byzantine Agreemet. In: STOC, pp. 639-648 (1988)
14. Fitzi, M., Garay, J., Gollakota, S., Pandu Rangan, C., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329-342. Springer, Heidelberg (2006)
15. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: STOC, pp. 580-589 (2001)
16. Katz, J., Koo, C., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 499-510. Springer, Heidelberg (2008)
17. Patra, A., Choudhary, A., Rabin, T., Pandu Rangan, C.: The round complexity of verifiable secret sharing revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487-504. Springer, Heidelberg (2009)
18. Patra, A., Choudhary, A., Pandu Rangan, C.: Efficient asynchronous multiparty computation with optimal resilience. Cryptology ePrint Archive, Report 2008/425 (2008)
19. Patra, A., Choudhary, A., Pandu Rangan, C.: Efficient asynchronous Byzantine Agreement with optimal resilience. In: PODC, pp. 92-101 (2009)
20. Patra, A., Choudhary, A., Pandu Rangan, C.: Unconditionally secure asynchronous multiparty computation with quadratic communication per multiplication gate. Cryptology ePrint Archive, Report 2009/087 (2009)
21. Patra, A., Choudhary, A., Pandu Rangan, C.: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience Cryptology ePrint Archive, Report 2010/007 (2010)
22. Prabhu, B., Srinathan, K., Pandu Rangan, C.: Trading players for efficiency in unconditional multiparty computation. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 342-353. Springer, Heidelberg (2003)
23. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC, pp. 73-85 (1989)
24. Srinathan, K., Pandu Rangan, C.: Efficient asynchronous secure multiparty distributed computation. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 117-129. Springer, Heidelberg (2000)
25. Yao, A.C.: Protocols for secure computations. In: FOCS, pp. 160-164 (1982)