Abstract
We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element).
Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity \(O(n\frac{2t+1}{t}^2)\) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n t 2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.
Chapter PDF
References
Alon, N., Spencer, J.: The Probabilistic Method. Wiley-Interscience, New York (2000)
Bar-Ilan, J., Beaver, D.: Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds of Interaction. In: Symposium on Principles Of Distributed Computing (PODC), pp. 201–209. ACM Press, New York (1989)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proc. 20-th STOC, pp. 1–10. ACM Press, New York (1988)
Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: STOC. Proceedings of the twentieth annual ACM Symp. Theory of Computing, May 2–4, 1988, pp. 11–19. ACM Press, New York (1988)
Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient Multi-Party Computation Over Rings. In: Biham, E. (ed.) Advances in Cryptology – EUROCRPYT 2003. LNCS, vol. 2656, pp. 596–613. Springer, Heidelberg (2003)
Desmedt, Y., Pieprzyk, J., Steinfeld, R., Wang, H.: On Secure Multi-Party Computation in Black-Box Groups. Full version of this paper(2007), Available at http://www.comp.mq.edu.au/~rons/
Desmedt, Y., Wang, Y., Burmester, M.: A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 277–287. Springer, Heidelberg (2005)
Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Trans. on Information Theory 22, 644–654 (1976)
ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Tran. Info. Theory, IT 31(4), 469–472 (1985)
Goldreich, O.: Foundations of Cryptography, Volume II. Cambridge University Press, Cambridge (2004)
Hirt, M., Maurer, U.: Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract). In: Symposium on Principles Of Distributed Computing (PODC), pp. 25–34. ACM Press, New York (1997)
Kushilevitz, E.: Privacy and Communication Complexity. SIAM J. on Discrete Mathematics 5(2), 273–284 (1992)
Magliveras, S., Stinson, D., van Trung, T.: New approaches to Designing Public Key Cryptosystems using One-Way Functions and Trapdoors in Finite Groups. Journal of Cryptology 15, 285–297 (2002)
Noonan, J.: New Upper Bounds for the Connective Constants of Self-Avoiding Walks. Journal of Statistical Physics 91(5/6), 871–888 (1998)
Paeng, S., Ha, K., Kim, J., Chee, S., Park, C.: New Public Key Cryptosystem Using Finite Non Abelian Groups. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 470–485. Springer, Heidelberg (2001)
Pönitz, A., Tittmann, P.: Improved Upper Bounds for Self-Avoiding Walks in ℤd. The Electronic Journal of Combinatorics 7 (2000)
Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 120–128 (1978)
Shamir, A.: How To Share a Secret. Communications of the ACM 22, 612–613 (1979)
Shor, P.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comp. 26(5), 1484–1509 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desmedt, Y., Pieprzyk, J., Steinfeld, R., Wang, H. (2007). On Secure Multi-party Computation in Black-Box Groups. In: Menezes, A. (eds) Advances in Cryptology - CRYPTO 2007. CRYPTO 2007. Lecture Notes in Computer Science, vol 4622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74143-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-74143-5_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74142-8
Online ISBN: 978-3-540-74143-5
eBook Packages: Computer ScienceComputer Science (R0)