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

Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

Published Jan 1, 2022• 1 citation
Publisher
DOI
10.1007/978-3-031-22912-1_10

Related papers

Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited.

Ashish Choudhury

•Jan 1, 2020•4 citations

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

Mrinal Kumar, Kannan Srinathan, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2002•7 citations

Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation

Ashish Choudhury

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

Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

arXiv:2205.13169•Journal of Cryptology•Apr 24, 2023•2 citations

Efficient General-Adversary Multi-Party Computation

Martin Hirt, Daniel Tschudi

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

Network Agnostic Perfectly Secure MPC Against General Adversaries

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

In this work, we study perfectly-secure multi-party computation (MPC) against general (non-threshold) adversaries. Known protocols in a synchronous network are secure against $Q^{(3)}$ adversary structures, while in an asynchronous network, known protocols are secure against $Q^{(4)}$ adversary structures. A natural question is whether there exists a single protocol which remains secure against $Q^{(3)}$ and $Q^{(4)}$ adversary structures in a synchronous and in an asynchronous network respectively, where the parties are not aware of the network type. We design the first such best-of-both-worlds protocol against general adversaries. Our result generalizes the result of Appan, Chandramouli and Choudhury (PODC 2022), which presents a best-of-both-worlds perfectly-secure protocol against threshold adversaries. To design our protocol, we present two important building blocks which are of independent interest. The first building block is a best-of-both-worlds perfectly-secure Byzantine agreement (BA) protocol for $Q^{(3)}$ adversary structures, which remains secure both in a synchronous, as well as an asynchronous network. The second building block is a best-of-both-worlds perfectly-secure verifiable secret-sharing (VSS) protocol, which remains secure against $Q^{(3)}$ and $Q^{(4)}$ adversary structures in a synchronous network and an asynchronous network respectively.

arXiv:2208.06223•Leibniz international proceedings in informatics•Aug 12, 2022•1 citation
In this work, we study perfectly-secure multi-party computation (MPC) against general (non-threshold) adversaries. Known protocols in a synchronous network are secure against Q(3)Q^{(3)}Q(3) adversary structures, while in an asynchronous network, known protocols are secure against Q(4)Q^{(4)}Q(4) adversary structures. A natural question is whether there exists a single protocol which remains secure against Q(3)Q^{(3)}Q(3) and Q(4)Q^{(4)}Q(4) adversary structures in a synchronous and in an asynchronous network respectively, where the parties are not aware of the network type. We design the first such best-of-both-worlds protocol against general adversaries. Our result generalizes the result of Appan, Chandramouli and Choudhury (PODC 2022), which presents a best-of-both-worlds perfectly-secure protocol against threshold adversaries. To design our protocol, we present two important building blocks which are of independent interest. The first building block is a best-of-both-worlds perfectly-secure Byzantine agreement (BA) protocol for Q(3)Q^{(3)}Q(3) adversary structures, which remains secure both in a synchronous, as well as an asynchronous network. The second building block is a best-of-both-worlds perfectly-secure verifiable secret-sharing (VSS) protocol, which remains secure against Q(3)Q^{(3)}Q(3) and Q(4)Q^{(4)}Q(4) adversary structures in a synchronous network and an asynchronous network respectively.