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

Lecture notes in computer science

Secure Constant-Round Multi-party Fair Exchange Without Broadcast Channel

Yuhi Fujisaka, Takeshi Nakai, Koutarou Suzuki

Published Oct 19, 2026• 0 citations
Publisher
DOI
10.1007/978-981-92-6831-3_25

Related papers

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Handan Kılınç, Alptekın Küpçü

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

Secure group barter: Multi-party fair exchange with semi-trusted neutral parties

Matt Franklin, Gene Tsudik

Lecture notes in computer science•Jan 1, 1998•67 citations

Coin-Based Multi-party Fair Exchange

Handan Kılınç Alper, Alptekın Küpçü

Lecture notes in computer science•Jan 1, 2021•4 citations

Fast Secure Computation for Small Population over the Internet

Megha Byali, Arun Antony Joseph, Arpita Patra +1 more

Secure Multi-Party Computation (MPC) with small number of parties is an interesting area of research, primarily due to its ability to model most real-life MPC applications and the simplicity and efficiency of the resulting protocols. In this work, we present efficient, constant-round 3-party (3PC) and 4-party (4PC) protocols in the honest-majority setting that achieve strong security notions of fairness (corrupted parties receive their output only if all honest parties receive output) and guaranteed output delivery (corrupted parties cannot prevent honest parties from receiving their output). Being constant-round, our constructions are suitable for Internet-like high-latency networks and are built from garbled circuits (GC). Assuming the minimal model of pairwise-private channels, we present two protocols that involve computation and communication of a single GC-- (a) a 4-round 3PC with fairness, (b) a 5-round 4PC with guaranteed output delivery. Empirically, our protocols are on par with the best known 3PC protocol of Mohassel et al. [CCS 2015] that only achieves security with selective abort, in terms of the computation time, LAN runtime, WAN runtime and communication cost. In fact, our 4PC outperforms the 3PC of Mohassel et al. significantly in terms of per-party computation and communication cost. With an extra GC, we improve the round complexity of our 4PC to four rounds. The only 4PC in our setting, given by Ishai et al. [CRYPTO 2015], involves 12 GCs. Assuming an additional broadcast channel, we present a 5-round 3PC with guaranteed output delivery that involves computation and communication of a single GC. A broadcast channel is inevitable in this setting for achieving guaranteed output delivery, owing to an impossibility result in the literature. The overall broadcast communication of our protocol is nominal and most importantly, is independent of the circuit size. This protocol too induces a nominal overhead compared to the protocol of Mohassel et al.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Oct 15, 2018•23 citations

An Entropy-View Secure Multiparty Computation Protocol Based on Semi-Honest Model

Yun Luo, Yuling Chen, Tao Li +3 more

Abstract Secure multi-party computation(SMPC) is an important research area in cryptography with many application scenarios, but there are still many problems to be solved. Aiming at security and fairness issues in SMPC, we consider that semi-honest participants are able to execute the protocol according to the specification, but there would be some additional malicious operations such as collusion and refuse to exchange information in the process of information interaction, which leads to deviations in the security and fairness of the protocol. To solve the above problems, we combine information entropy and mutual information to propose an n-round information exchange protocol, in which each participant broadcasts a relevant information value in each round without revealing additional information. The uncertainty of the correct result value is fuzzed by the interactive information in each round, and each participant cannot determine the correct result value until the end of the protocol, which effectively prevents malicious behavior and ensures the correct execution of the protocol. Security analysis and fairness analysis show that under the semi-honest model, our protocol guarantees the security and relative fairness of the output obtained by the participants after completing the protocol.

Journal of Organizational and End User Computing•Jul 14, 2022•10 citations

Identity-based fair multi-party exchange protocol

Mei-mei FAN, Changgen Peng

Journal of Computer Applications•Apr 7, 2009•1 citation
Secure Multi-Party Computation (MPC) with small number of parties is an interesting area of research, primarily due to its ability to model most real-life MPC applications and the simplicity and efficiency of the resulting protocols. In this work, we present efficient, constant-round 3-party (3PC) and 4-party (4PC) protocols in the honest-majority setting that achieve strong security notions of fairness (corrupted parties receive their output only if all honest parties receive output) and guaranteed output delivery (corrupted parties cannot prevent honest parties from receiving their output). Being constant-round, our constructions are suitable for Internet-like high-latency networks and are built from garbled circuits (GC). Assuming the minimal model of pairwise-private channels, we present two protocols that involve computation and communication of a single GC-- (a) a 4-round 3PC with fairness, (b) a 5-round 4PC with guaranteed output delivery. Empirically, our protocols are on par with the best known 3PC protocol of Mohassel et al. [CCS 2015] that only achieves security with selective abort, in terms of the computation time, LAN runtime, WAN runtime and communication cost. In fact, our 4PC outperforms the 3PC of Mohassel et al. significantly in terms of per-party computation and communication cost. With an extra GC, we improve the round complexity of our 4PC to four rounds. The only 4PC in our setting, given by Ishai et al. [CRYPTO 2015], involves 12 GCs. Assuming an additional broadcast channel, we present a 5-round 3PC with guaranteed output delivery that involves computation and communication of a single GC. A broadcast channel is inevitable in this setting for achieving guaranteed output delivery, owing to an impossibility result in the literature. The overall broadcast communication of our protocol is nominal and most importantly, is independent of the circuit size. This protocol too induces a nominal overhead compared to the protocol of Mohassel et al.
Abstract Secure multi-party computation(SMPC) is an important research area in cryptography with many application scenarios, but there are still many problems to be solved. Aiming at security and fairness issues in SMPC, we consider that semi-honest participants are able to execute the protocol according to the specification, but there would be some additional malicious operations such as collusion and refuse to exchange information in the process of information interaction, which leads to deviations in the security and fairness of the protocol. To solve the above problems, we combine information entropy and mutual information to propose an n-round information exchange protocol, in which each participant broadcasts a relevant information value in each round without revealing additional information. The uncertainty of the correct result value is fuzzed by the interactive information in each round, and each participant cannot determine the correct result value until the end of the protocol, which effectively prevents malicious behavior and ensures the correct execution of the protocol. Security analysis and fairness analysis show that under the semi-honest model, our protocol guarantees the security and relative fairness of the output obtained by the participants after completing the protocol.