Abstract
Secure multi-party computation (MPC) is an active research area, and a wide range of literature can be found nowadays suggesting improvements and generalizations of existing protocols in various directions. However, all current techniques for secure MPC apply to functions that are represented by (boolean or arithmetic) circuits over finite fields. We are motivated by two limitations of these techniques:
-
Generality. Existing protocols do not apply to computation over more general algebraic structures (except via a brute-force simulation of computation in these structures).
-
Efficiency. The best known constant-round protocols do not efficiently scale even to the case of large finite fields.
Our contribution goes in these two directions. First, we propose a basis for unconditionally secure MPC over an arbitrary ginite ring, an algebraic object with a much less nice structure than a field, and obtain efficient MPC protocols requiring only a black-box access to the ring operations and to random ring elements. Second, we extend these results to the constant-round setting, and suggest efficiency improvements that are relevant also for the important special case of fields. We demonstrate the usefulness of the above results by presenting a novel application of MPC over (non-field) rings to the round-efficient secure computation of the maximum function.
Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. of 8th PODC, pp. 201–209, 1989.
D. Beaver. Efficient multiparty protocols using circuit randomization. In Proc. of CRYPTO’ 91, LNCS 576, pp. 420–432, 1991.
D. Beaver. Minimal-latency secure function evaluation. In Proc. of EUROCRYPT’ 00, LNCS 1807, pp. 335–350, 2000.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In Proc. of CRYPTO’ 90, LNCS 537, pp. 62–76, 1990.
D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pp. 503–513, 1990.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pp. 1–10, 1988.
R. Canetti. Security and composition of multiparty cryptographic protocols. In J. of Cryptology, 13(1):143–202, 2000.
R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. of 42nd FOCS, pp. 136–145, 2001.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively secure computation. In Proc. of 28th STOC, pp. 639–648, 1996.
D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditional secure protocols. In Proc. of 20th STOC, pp. 11–19, 1988.
C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In Proc. of 27th ICALP, pp. 512–523, 2000.
R. Cleve. Towards Optimal Simulations of Formulas by Bounded-Width Programs. In Computational Complexity 1: 91–105, 1991.
R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT’ 00, LNCS 1807, pp. 316–334, 2000.
R. Cramer, I. Damgård, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. of EUROCRYPT’ 01, LNCS 2045, pp. 280–299, 2001.
R. Cramer and S. Fehr. Optimal black-box secret sharing over arbitrary Abelian groups. In Proc. of CRYPTO’ 02, LNCS 2442, 272–287, 2002.
R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient multi-party computation over rings. Cryptology ePrint Archive, Report 2003/030, 2003.
A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. of 26th STOC, pp. 522–533, 1994.
Y. G. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite Abelian group. In SIAM Journal on Discrete Mathematics, 7(4):667–679, 1994.
M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In Proc. of CRYPTO’ 98, LNCS 1462, pp. 121–136, 1998.
U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc. of 26th STOC, pp. 554–563, 1994.
M. Fitzi and U. Maurer Efficient Byzantine agreement secure against general adversaries. In Proc. of DISC’ 98, LNCS 1499, pp. 134–148, 1998.
M. Franklin and M. Yung. Communication complexity of secure computation. In Proc. of 24th STOC, pp. 699–710, 1992.
R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. of 17th PODC, pp. 101–111, 1998.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game (extended abstract). In Proc. of 19th STOC, pp. 218–229, 1987.
M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In Proc. of 16th PODC, 1997, pp. 25–34.
M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In Proc. of CRYPTO’ 01, LNCS 2139, pp. 101–118, 2001.
M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In Proc. of ASIACRYPT’ 00, LNCS 1976, pp. 143–161, 2000.
Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. of 41th FOCS, pp. 294–304, 2000.
Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In Proc. of 29th ICALP, pp. 244–256, 2002.
M. Karchmer and A. Wigderson. On span programs. In Proc. of 8th Conference on Structure in Complexity Theory, pp. 102–111, 1993.
J. Kilian. Founding cryptography on oblivious transfer. In Proc. of 20th STOC, pp. 20–31, 1988.
Y. Lindell. Parallel coin-tossing and constant-round secure two-party Computation. In Proc. of CRYPTO’ 01, LNCS 2139, pp. 171–189, 2001.
M. Naor, and K. Nissim. Communication Preserving Protocols for Secure Function Evaluation. In Proc. of 33rd STOC, pp. 590–599, 2001.
R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. of 10th PODC, pp. 51–59, 1991.
T. Sandler, A. Young, and M. Yung. Non-interactive cryptocomputing for NC1. In Proc. of 40th FOCS, pp. 554–567, 1999.
A. Shamir. How to share a secret. CACM, 22(11):612–613, 1979.
A. C. Yao. Protocols for secure computations. In Proc. of 23th FOCS, pp. 160–164, 1982.
A. C. Yao. How to generate and exchange secrets. In Proc. of 27th FOCS, pp. 162–167, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 International Association for Cryptologic Research
About this paper
Cite this paper
Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E. (2003). Efficient Multi-party Computation over Rings. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_37
Download citation
DOI: https://doi.org/10.1007/3-540-39200-9_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14039-9
Online ISBN: 978-3-540-39200-2
eBook Packages: Springer Book Archive