On Secure Multi-party Computation in Black-Box Groups

  title={On Secure Multi-party Computation in Black-Box Groups},
  author={Yvo Desmedt and Josef Pieprzyk and Ron Steinfeld and Huaxiong Wang},
We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x2 · · ·xn in an arbitrary finite group (G, ·), where the input of party Pi is xi ∈ G for i = 1, . . . , n. For flexibility, we are interested in protocols for fG 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… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 10 extracted citations

Advances in Cryptology – CRYPTO 2013

Lecture Notes in Computer Science • 2013
View 14 Excerpts
Highly Influenced

Secure two-party computation with AES-128: Generic approach and exploiting specific properties of functions approach

The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014) • 2014
View 1 Excerpt

Share Conversion and Private Information Retrieval

2012 IEEE 27th Conference on Computational Complexity • 2012

Securing Abstention in an Electronic Legislature

Proceedings of the 38th Annual Hawaii International Conference on System Sciences • 2005


Publications referenced by this paper.
Showing 1-10 of 23 references

On Secure Multi-Party Computation in Black-Box Groups

Y. Desmedt, J. Pieprzyk, R. Steinfeld, H. Wang
Full version of this paper, • 2007
View 9 Excerpts
Highly Influenced

Efficient Multi-Party Computation over Rings

IACR Cryptology ePrint Archive • 2003
View 6 Excerpts
Highly Influenced

Privacy and Communication Complexity

FOCS • 1989
View 3 Excerpts
Highly Influenced

and T

S. Magliveras, D. Stinson
van Trung. New approaches to Designing Public Key Cryptosystems using One-Way Functions and Trapdoors in Finite Groups. Journal of Cryptology, 15:285–297, • 2002
View 1 Excerpt

Improved Upper Bounds for SelfAvoiding Walks in ZZ d

A. Pönitz, P. Tittmann
The Electronic Journal of Combinatorics • 2000

Similar Papers

Loading similar papers…