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

arXiv:1909.13770 · Lecture notes in computer science

Secure Multi-party Quantum Computation with a Dishonest Majority

Yfke Dulek, Alex B. Grilo, Stacey Jeffery, Christian Majenz, Christian Schaffner

Published Jan 1, 2020• 58 citations
arXivHTMLPDF
DOI
10.1007/978-3-030-45727-3_25

Related papers

Adaptively Secure Multi-Party Computation with Dishonest Majority

Sanjam Garg, Amit Sahai

Lecture notes in computer science•Jan 1, 2012•31 citations

Improved Secure Multiparty Computation with a Dishonest Majority via Quantum Means

Yanbing Li, Qiaoyan Wen, Su‐Juan Qin

International Journal of Theoretical Physics•Aug 28, 2012•10 citations

Dishonest Majority Multi-Party Computation for Binary Circuits

Enrique Larraia, Emmanuela Orsini, Nigel Paul Smart

Lecture notes in computer science•Jan 1, 2014•66 citations

Multi-party quantum private comparison with an almost-dishonest third party

Sheng‐Liang Huang, Tzonelih Hwang, Prosanta Gope

Quantum Information Processing•Aug 28, 2015•42 citations

Bounded-concurrent secure multi-party computation with a dishonest majority

Rafael Pass

We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number of corrupted parties. Previous protocols for the above task either rely on set-up assumptions such as a Common Reference String, or require an honest majority. Our constructions are in the plain model and rely on standard intractability assumptions (enhanced trapdoor permutations and collision resistant hash functions). Even though our main focus is on feasibility of concurrent multi-party computation we actually obtain a protocol using only a constant number of communication rounds. As a consequence our protocol yields the first construction of constant-round phstand-alone secure multi-party computation with a dishonest majority, proven secure under standard (polynomial-time) hardness assumptions; previous solutions to this task either require logarithmic round-complexity, or subexponential hardness assumptions. The core of our protocol is a novel construction of (concurrently) simulation-sound zero-knowledge protocols, which might be of independent interest. Finally, we extend the framework constructed to give a protocol for secure multi-party (and thus two-party) computation for any number of corrupted parties, which remains secure even when arbitrary subsets of parties concurrently execute the protocol, possibly with interchangeable roles. As far as we know, for the case of two-party or multi-party protocols with a dishonest majority, this is the first positive result for any non-trivial functionality which achieves this property in the plain model.

ACM Symposium on Theory of Computing (STOC)•Jun 13, 2004•181 citations

Secure Two-Party Computation in a Quantum World

Niklas Büscher, Daniel Demmler, Nikolaos P. Karvelas +5 more

Lecture notes in computer science•Jan 1, 2020•16 citations
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number of corrupted parties. Previous protocols for the above task either rely on set-up assumptions such as a Common Reference String, or require an honest majority. Our constructions are in the plain model and rely on standard intractability assumptions (enhanced trapdoor permutations and collision resistant hash functions). Even though our main focus is on feasibility of concurrent multi-party computation we actually obtain a protocol using only a constant number of communication rounds. As a consequence our protocol yields the first construction of constant-round phstand-alone secure multi-party computation with a dishonest majority, proven secure under standard (polynomial-time) hardness assumptions; previous solutions to this task either require logarithmic round-complexity, or subexponential hardness assumptions. The core of our protocol is a novel construction of (concurrently) simulation-sound zero-knowledge protocols, which might be of independent interest. Finally, we extend the framework constructed to give a protocol for secure multi-party (and thus two-party) computation for any number of corrupted parties, which remains secure even when arbitrary subsets of parties concurrently execute the protocol, possibly with interchangeable roles. As far as we know, for the case of two-party or multi-party protocols with a dishonest majority, this is the first positive result for any non-trivial functionality which achieves this property in the plain model.