Minimal Complete Primitives for Secure Multi-Party Computation
Matthias Fitzi, Juan A. Garay, Ueli Maurer, Rafail Ostrovsky
Abstract:
The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of complete primitives for the case of two players has been thoroughly studied. However, in the multi-party setting, when there are $n>2$ players and $t$ of them are corrupted, the question of what are the simplest complete primitives remained open for $t \geq n/3$. We consider this question, and introduce complete primitives {\em of minimal cardinality} for secure multi-party computation. The cardinality issue (number of players accessing the primitive) is essential in settings where the primitives are implemented by some other means, and the simpler the primitive the easier it is to realize it. We show that our primitives are complete and of minimal cardinality possible.
comment:
Journal of Cryptology
Publisher: Springer-Verlag New York, LLC
ISSN: 0933-2790 (Paper) 1432-1378 (Online)
Volume 18, Number 1 January 2005
Pages: 37 - 61
Preliminary version in in Proceedings of Advances in Cryptology, (CRYPTO-2001)
Springer-Verlag/IACR Lecture Notes in Computer Science.
Fetch PostScript file of the paper Fetch PDF file of the paper