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

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

Koji Nuida

Published Jan 1, 2016• 0 citations
OpenAlex

Related papers

When Is a Semi-honest Secure Multiparty Computation Valuable?

Radhika Bhargava, Chris Clifton

Lecture notes in computer science•Jan 1, 2019•1 citation

Round-Optimal Secure Multiparty Computation with Honest Majority

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel +1 more

Lecture notes in computer science•Jan 1, 2018•48 citations

A novel quantum multiparty summation protocol based on a cooperative random number mechanism

Kejia Zhang, Yu Zhang, Xue Zhang +3 more

As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to $n - 2$ participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.

EPJ Quantum Technology•May 22, 2025•1 citation

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

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation

Vipul Goyal, Yuval Ishai, Yifan Song

Lecture notes in computer science•Jan 1, 2022•5 citations

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

Ivan Damgård, Yuval Ishai, Mikkel Krøigaard

Lecture notes in computer science•Jan 1, 2010•183 citations
As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to n−2n - 2n−2 participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.
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.