Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Cryptology

Minimal Complete Primitives for Secure Multi-Party Computation

Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky

Published Apr 27, 2004• 25 citations
Publisher
DOI
10.1007/s00145-004-0150-y

Related papers

Minimal Complete Primitives for Secure Multi-party Computation

Matthias Fitzi, Juan A. Garay, Ueli M. Maurer +1 more

Lecture notes in computer science•Jan 1, 2001•26 citations

Lean and Fast Secure Multi-party Computation: Minimizing Communication and Local Computation using a Helper

Johannes Schneider

International Joint Conference on e-Business and Telecommunications (ICETE)•Jan 1, 2016•6 citations

An elementary completeness proof for secure two-party computation primitives

Ye Wang, Prakash Sharma Ishwar, Shantanu D. Rane

In the secure two-party computation problem, two parties wish to compute a (possibly randomized) function of their inputs via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their own input and output. For semi-honest parties and information-theoretic security guarantees, it is well-known that, if only noise-less communication is available, only a limited set of functions can be securely computed; however, if interaction is also allowed over general communication primitives (multi-input/output channels), there are “complete” primitives that enable any function to be securely computed. The general set of complete primitives was characterized recently by Maji, Prabhakaran, and Rosulek leveraging an earlier specialized characterization by Kilian. Our contribution in this paper is a simple, self-contained, alternative derivation using elementary information-theoretic tools.

arXiv:1402.4360•IEEE Information Theory Workshop (ITW)•Nov 1, 2014•0 citations

Efficient Constructions and Implementations for Secure Multi-Party Computation

Kazuma Ohara

•Sep 30, 2019•0 citations

Secure multi-party computation problems and their applications

Wenliang Kevin Du, Mikhail J. Atallah

New Security Paradigms Workshop•Jan 1, 2001•19 citations

Secure Two-Party Sampling Primitives are either Useless or Complete.

Ye Wang, Prakash Sharma Ishwar, Shantanu D. Rane

In the secure two-party sampling problem, two parties wish to generate outputs with a desired joint distribution via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their own output. For semi-honest parties and information-theoretic privacy guarantees, it is well-known that if only noiseless communication is available, then only the joint distributions, for which common information equals mutual information, can be securely sampled. We consider the problem where the parties may also interact via a given set of general communication primitives (multi-input/output channels). Our feasibility characterization of this problem can be stated as a zero-one law: primitives are either complete (enabling the secure sampling of any distribution) or useless (only enabling the secure sampling of trivial distributions). Our characterization of the complete primitives also extends to the more general class of secure two-party computation problems.

•Feb 18, 2014•0 citations
In the secure two-party computation problem, two parties wish to compute a (possibly randomized) function of their inputs via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their own input and output. For semi-honest parties and information-theoretic security guarantees, it is well-known that, if only noise-less communication is available, only a limited set of functions can be securely computed; however, if interaction is also allowed over general communication primitives (multi-input/output channels), there are “complete” primitives that enable any function to be securely computed. The general set of complete primitives was characterized recently by Maji, Prabhakaran, and Rosulek leveraging an earlier specialized characterization by Kilian. Our contribution in this paper is a simple, self-contained, alternative derivation using elementary information-theoretic tools.
In the secure two-party sampling problem, two parties wish to generate outputs with a desired joint distribution via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their own output. For semi-honest parties and information-theoretic privacy guarantees, it is well-known that if only noiseless communication is available, then only the joint distributions, for which common information equals mutual information, can be securely sampled. We consider the problem where the parties may also interact via a given set of general communication primitives (multi-input/output channels). Our feasibility characterization of this problem can be stated as a zero-one law: primitives are either complete (enabling the secure sampling of any distribution) or useless (only enabling the secure sampling of trivial distributions). Our characterization of the complete primitives also extends to the more general class of secure two-party computation problems.