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

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell

Published May 20, 2005• 109 citations
Publisher
DOI
10.1007/s00145-005-0319-z

Related papers

Secure Multi-Party Computation from Strongly Uniform Key Agreement.

Daniele Friolo, Daniel Masny, Daniele Venturi

•Jan 1, 2018•3 citations

Secure Multi-party Computation

Nigel Paul Smart

Information security and cryptography•Nov 12, 2015•53 citations

Study on Commitment Schemes of Secure Multi-party Computation

Xiaoqiang Guo, Yan Yan, Lihong Li +1 more

The problem of secure multi-party computation(SMPC) is one of the most fundamental problems in information security. First, we introduce the basic concept of SMPC and four SMPC basic agreement: key distribution,oblivious transfer, bit commitment and zero knowledge proof. Secondly, we separately illustrate commitment schemes  commitment transfer protocol, commitment sharing protocol and commitment multiplication protocol. Finally, we present unconditionally secure multi-party computation with a passive adversary, an active adversary, general adversary structures.

Indonesian Journal of Electrical Engineering and Computer Science•Oct 1, 2014•0 citations

Secure Multi-Party Computation

Renren Dong

•Jan 1, 2009•0 citations

A Key Agreement of the Improvements Based on Secure two-Party Computation

Junming Zhang

Secure Multiparty Computation protocol is an important area in cryptography.The research of multi-party computation was a subject of great importance in the international cryptographic circle.A key agreement scheme based on secure two-party computation is improved.Three schemes are proposed.It can be proved that even if Eve gets the same data as the receiver,the schemes are still secure.

Journal of Kaili University•Jan 1, 2011•0 citations

On the Communication Complexity of Secure Multi-Party Computation With Aborts

James Bartusek, Thiago Bergamaschi, Seri Khoury +2 more

A central goal of cryptography is Secure Multi-party Computation (MPC), where n parties desire to compute a function of their joint inputs without letting any party learn about the inputs of its peers. Unfortunately, it is well-known that MPC guaranteeing output delivery to every party is infeasible when a majority of the parties are malicious. In fact, parties operating over a point-to-point network (i.e., without access to a broadcast channel) cannot even reach an agreement on the output when more than one third of the parties are malicious (Lamport, Shostak, and Pease, JACM 1980).

arXiv:2406.06914•ACM Symposium on Principles of Distributed Computing (PODC)•Jun 5, 2024•0 citations
The problem of secure multi-party computation(SMPC) is one of the most fundamental problems in information security. First, we introduce the basic concept of SMPC and four SMPC basic agreement: key distribution,oblivious transfer, bit commitment and zero knowledge proof. Secondly, we separately illustrate commitment schemes  commitment transfer protocol, commitment sharing protocol and commitment multiplication protocol. Finally, we present unconditionally secure multi-party computation with a passive adversary, an active adversary, general adversary structures.
A central goal of cryptography is Secure Multi-party Computation (MPC), where n parties desire to compute a function of their joint inputs without letting any party learn about the inputs of its peers. Unfortunately, it is well-known that MPC guaranteeing output delivery to every party is infeasible when a majority of the parties are malicious. In fact, parties operating over a point-to-point network (i.e., without access to a broadcast channel) cannot even reach an agreement on the output when more than one third of the parties are malicious (Lamport, Shostak, and Pease, JACM 1980).