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

ACM Symposium on Theory of Computing (STOC)

Multiparty unconditionally secure protocols

David Chaum, Claude Crépeau, Ivan Damgård

Published Jan 1, 1988• 1,602 citations
Publisher

Abstract

Under the assumption that each pair of participants em communieatc secretly, we show that any reasonable multiparty protwol can be achieved if at least Q of the Participants am honest. The secrecy achieved is unconditional, It does not rely on any assumption about computational intractability. 1.
DOI
10.1145/62212.62214

Related papers

Verifiable secret sharing and multiparty protocols with honest majority

Tal Rabin, Michael Ben-Or

Under the assumption that each participant can broadcast a message to all other participants and that each pair of participants can communicate secretly, we present a verifiable secret sharing protocol, and show that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest. The secrecy achieved is unconditional and does not rely on any assumption about computational intractability. Applications of these results to Byzantine Agreement are also presented.

ACM Symposium on Theory of Computing (STOC)•Jan 1, 1989•956 citations

A non-interactive multiparty computation protocol

Hossein Ghodosi, Rahim Zaare-Nahandi

Multiparty computation considers the design of protocols such that a set of n users U] ... lim each with their own secret input Xi, can compute a function Y =F(x], ... , x/J. In this paper, we study a requirement for devising non-interactive multiparty computation protocols and present the first non-interactive multiparty computation protocol, which has the following advantages: a) The amount of computation required by each participant is equal to the amount of computation in an ideal model (i.e. the proposed scheme is optimal). b) In the presence of passive adversaries, no set of less than n users can leam more than what is allowed in the underlying secret sharing scheme (other than the function value), c) In the presence of active adversaries (i.e, Byzantine faults are allowed), no set of less than nl2 users can either leam more than what is allowed in the underlying secret sharing scheme, nor can they dismpt the computation. d) The partial security provided in our scheme is unconditional. That is, the proposed scheme does not rely on any non-proven cryptographic assumption.

•Jan 1, 2007•0 citations

On Achieving the “Best of Both Worlds” in Secure Multiparty Computation

Yuval Ishai, Jonathan I. Katz, Eyal Kushilevitz +2 more

Two settings are traditionally considered for secure multiparty computation, depending on whether or not a majority of the parties are assumed to be honest. Existing protocols that assume an honest majority provide “full security” (and, in particular, guarantee output delivery and fairness) when this assumption holds, but are completely insecure if this assumption is violated. On the other hand, known protocols tolerating an arbitrary number of corruptions do not guarantee fairness or output delivery even if only a single party is dishonest. It is natural to wonder whether it is possible to achieve the “best of both worlds”: namely, a single protocol that simultaneously achieves the best possible security in both the above settings. Here, we rule out this possibility (at least for general functionalities) and show some positive results regarding what can be achieved.

SIAM Journal on Computing•Jan 1, 2011•32 citations

Performance Analysis of Secure Multiparty Computation Protocol

Samiksha Shukla, Durgesh Kumar Mishra

In this paper we address the issue related to privacy, security, complexity and Implementation, various adversaries exist which hamper the secure multiparty computation. In the secure multiparty computation, a set of parties wishes to jointly compute some function of their inputs. Such a computation must preserve certain security properties, like privacy and correctness, even if some of the participating parties or an external adversary colludes to attack the honest parties.

Mapana Journal of Sciences•May 31, 2009•0 citations

Semi-Honest Secure Multiparty Computation Can Be Insecure with Use of Even Almost Uniformly Random Number Generators.

Koji Nuida

•Jan 1, 2016•0 citations

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.

Yonatan Aumann, Yehuda Lindell

Abstract In the setting of secure multiparty computation, a set of mutually distrustful parties wishto securely compute some joint function of their private inputs. The computation should be

•Jan 1, 2007•0 citations
Under the assumption that each participant can broadcast a message to all other participants and that each pair of participants can communicate secretly, we present a verifiable secret sharing protocol, and show that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest. The secrecy achieved is unconditional and does not rely on any assumption about computational intractability. Applications of these results to Byzantine Agreement are also presented.
Multiparty computation considers the design of protocols such that a set of n users U] ... lim each with their own secret input Xi, can compute a function Y =F(x], ... , x/J. In this paper, we study a requirement for devising non-interactive multiparty computation protocols and present the first non-interactive multiparty computation protocol, which has the following advantages: a) The amount of computation required by each participant is equal to the amount of computation in an ideal model (i.e. the proposed scheme is optimal). b) In the presence of passive adversaries, no set of less than n users can leam more than what is allowed in the underlying secret sharing scheme (other than the function value), c) In the presence of active adversaries (i.e, Byzantine faults are allowed), no set of less than nl2 users can either leam more than what is allowed in the underlying secret sharing scheme, nor can they dismpt the computation. d) The partial security provided in our scheme is unconditional. That is, the proposed scheme does not rely on any non-proven cryptographic assumption.
Two settings are traditionally considered for secure multiparty computation, depending on whether or not a majority of the parties are assumed to be honest. Existing protocols that assume an honest majority provide “full security” (and, in particular, guarantee output delivery and fairness) when this assumption holds, but are completely insecure if this assumption is violated. On the other hand, known protocols tolerating an arbitrary number of corruptions do not guarantee fairness or output delivery even if only a single party is dishonest. It is natural to wonder whether it is possible to achieve the “best of both worlds”: namely, a single protocol that simultaneously achieves the best possible security in both the above settings. Here, we rule out this possibility (at least for general functionalities) and show some positive results regarding what can be achieved.