Abstract
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network has very large connectivity — in fact, Ω(t), where t is the number of potential corruptions in the network. This impossibility result renders existing MPC results far less applicable in practice, since many deployed networks have in fact a very small degree.
In this paper, we show how to circumvent this impossibility result and achieve meaningful security guarantees for graphs with small degree (such as expander graphs and several other topologies). In fact, the notion we introduce, which we call almost-everywhere MPC, building on the notion of almost-everywhere agreement due to Dwork, Peleg, Pippenger and Upfal, allows the degree of the network to be much smaller than the total number of allowed corruptions. In essence, our definition allows the adversary to implicitly wiretap some of the good nodes by corrupting sufficiently many nodes in the “neighborhood” of those nodes. We show protocols that satisfy our new definition, retaining both correctness and privacy for most nodes despite small connectivity, no matter how the adversary chooses his corruptions.
Instrumental in our constructions is a new model and protocol for the secure message transmission (SMT) problem, which we call SMT by public discussion, and which we use for the establishment of pairwise secure channels in limited connectivity networks.
Chapter PDF
References
Agarwal, S., Cramer, R., de Haan, R.: Asymptotically optimal two-round perfectly secure message transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, Springer, Heidelberg (2006)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th Annual ACM Symposium of the Theory of Computation, pp. 1–10 (May 1988)
Bennett, C.H., Brassard, G., Crèpeau, C., Maurer, U.: Generalized privacy amplification. IEEE Transactions on Information Theory 41(6), 1015–1923 (1995)
Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. Siam Journal of Computing 17(2) (April 1988)
Berman, P., Garay, J.: Fast consensus in networks of bounded degree. WDAG 1990 2(7), 62–73 (1993); Preliminary version in WDAG 1990
Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings 20th Annual Symposium on Theory of Computing, STOC, Association for Computing Machinery (May 1988)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and simultaneous broadcast. In: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 383–395 (1985)
Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 502–517. Springer, Heidelberg (2002)
Dolev, D.: The byzantine generals strike again. Journal of Algorithms 1(3), 14–30 (1982)
Dolev, D., Dwork, C., Waarts, O., Young, M.: Perfectly secure message transmission. Journal of ACM 1(40), 17–47 (1993)
Dwork, C., Peleg, D., Pippinger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: Proc. 18th Annual Symposium on the Theory of Computing, pp. 370–379 (1986)
Fitzi, M., Franklin, M., Garay, J., Vardhan, S.H.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, Springer, Heidelberg (2007)
Fitzi, M., Garay, J., Gollakota, S., Rangan, C.P., 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)
Fitzi, M., Hirt, M., Maurer, U.: Trading correctness for privacy in unconditional mpc. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, Springer, Heidelberg (1998)
Franklin, M.K., Wright, R.N.: Secure communications in minimal connectivity models. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 346–360. Springer, Heidelberg (1998)
Garay, J., Moses, Y.: Fully polynomial Byzantine agreement for n > 3t processors in t + 1 rounds. SIAM J. Comput. 27(1), 247–290 (1998); Preliminary version in STOC 1992
Garay, J., Ostrovsky, R., Vaya, S.: Almost-eveywhere secure computation. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, Springer, Heidelberg (2007)
Garay, J., Ostrovsky, R., Vaya, S.: Almost-eveywhere secure computation. In: Presentation at the 2007 Workshop on Cryptographic Protocols WCP 2007, Bertinoro, Italy (March 2007)
Garay, J., Perry, K.: A continuum of failure models for distributed computing. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 153–165. Springer, Heidelberg (1992)
Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-round secure multiparty computation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, Springer, Heidelberg (2002)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for orotocols with honest majority. In: Proc. 19th Annual ACM Symposium on Theory of Computation, pp. 218–229 (May 1987)
Goldreich, O.: Secure multi-party computation, final (incomplete) draft, version 1.4 (2002)
Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM Journal on Computing 29 (1999)
Kurosawa, K., Suzuki, K.: Truly efficient 2-round perfectly secure message transmission scheme. These proceedings
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 382–401 (July 1982)
Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM, JACM 27(2) (April 1980)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. 21st ACM Symposium on the Theory of Computing, pp. 73–85 (1989)
Sayeed, H., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Information and Computation 1(126), 53–61 (1996)
Srinathan, K., Narayanan, A., Pandu Rangan, C.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545–561. Springer, Heidelberg (2004)
Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: Proc. 11th ACM Symposiyum on Principles of Distributed Computing, pp. 83–89 (1992)
Vaya, S.: Almost-everywhere secure computation. Ph.D. Thesis, University of California at Los Angeles, California (December 2006)
Vaya, S.: Secure computation on incomplete networks. In: Cryptology ePrint archive, Report 2007/346 (September 2007)
Yao, A.: Protocols for secure computation. In: Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garay, J.A., Ostrovsky, R. (2008). Almost-Everywhere Secure Computation. In: Smart, N. (eds) Advances in Cryptology – EUROCRYPT 2008. EUROCRYPT 2008. Lecture Notes in Computer Science, vol 4965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78967-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-78967-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78966-6
Online ISBN: 978-3-540-78967-3
eBook Packages: Computer ScienceComputer Science (R0)