Abstract
We propose an efficient statistically secure asynchronous multiparty computation (AMPC) protocol with optimal fault tolerance; i.e., with n = 3t + 1, where n is the total number of parties and t is the number of parties that can be under the influence of a Byzantine (active) adversary \({\cal A}_t\) having unbounded computing power. Our protocol privately communicates \({\cal O}(n^5 \kappa)\) bits per multiplication gate and involves a negligible error probability of 2 − Ω(κ), where κ is the error parameter. As far as our knowledge is concerned, the only known statistically secure AMPC protocol with n = 3t + 1 is due to [7], which privately communicates Ω(n 11 κ 4) bits and A-casts Ω(n 11 κ 2 log(n)) bits per multiplication gate. Here A-cast is an asynchronous broadcast primitive, which allows a party to send some information to all other parties identically. Thus our AMPC protocol shows significant improvement in communication complexity over the AMPC protocol of [7].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420–432. Springer, Heidelberg (1992)
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)
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)
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)
Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52–61 (1993)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1–10 (1988)
Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: PODC, pp. 183–192 (1994)
Bracha, G.: An asynchronous \(\lfloor (n - 1) / 3 \rfloor\)-resilient consensus protocol. In: PODC, pp. 154–162 (1984)
Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (1995)
Canetti, R., Rabin, T.: Fast asynchronous Byzantine Agreement with optimal resilience. In: STOC, pp. 42–51 (1993)
Chaum, D., Crpeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11–19 (1988)
Cramer, R., Damgård, I.: Multiparty Computation, an Introduction. In: Contemporary Cryptography. Birkhuser, Basel (2005)
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)
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)
Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fact-track multiparty computations with applications to threshold cryptography. In: PODC, pp. 101–111 (1998)
Patra, A., Choudhary, A., Pandu Rangan, C.: Efficient statistical asynchronous verifiable secret sharing and multiparty computation with optimal resilience. In: Cryptology ePrint Archive, Report 2009/492. A preliminary version of this paper got accepted in ICITS 2009 (2009)
Patra, A., Choudhary, A., Pandu Rangan, C.: Simple and efficient asynchronous Byzantine Agreement with optimal resilience. In: Cryptology ePrint Archive, Report 2008/424. Also appeared in Proc. of PODC (2009)
Rabin, T.: Robust sharing of secrets when the dealer is honest or cheating. J. ACM 41(6), 1089–1109 (1994)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC, pp. 73–85 (1989)
Yao, A.C.: Protocols for secure computations. In: FOCS, pp. 160–164 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patra, A., Choudhary, A., Rangan, C.P. (2010). Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds) Information Security and Cryptology. Inscrypt 2009. Lecture Notes in Computer Science, vol 6151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16342-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-16342-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16341-8
Online ISBN: 978-3-642-16342-5
eBook Packages: Computer ScienceComputer Science (R0)