2026-07-25T02:34:12Z
https://drops.dagstuhl.de/oai
oai:drops-oai.dagstuhl.de:19129
2024-03-06T11:03:29Z
ddc:004
open_access
Network Agnostic Perfectly Secure MPC Against General Adversaries
Appan, Ananya
Chandramouli, Anirudh
Choudhury, Ashish
Verifiable Secret Sharing
Byzantine Agreement
Perfect Security
In this work, we study perfectly-secure multi-party computation (MPC) against general (non-threshold) adversaries. Known protocols are secure against π¬^{(3)} and π¬^{(4)} adversary structures in a synchronous and an asynchronous network respectively. We address the existence of a single protocol which remains secure against π¬^{(3)} and π¬^{(4)} adversary structures in a synchronous and in an asynchronous network respectively, where the parties are unaware of the network type. We design the first such protocol against general adversaries. Our result generalizes the result of Appan, Chandramouli and Choudhury (PODC 2022), which presents such a protocol against threshold adversaries.
Schloss Dagstuhl β Leibniz-Zentrum fΓΌr Informatik
Ananya Appan and Anirudh Chandramouli and Ashish Choudhury
2023
Is Part Of LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/LIPIcs.DISC.2023.3
urn:nbn:de:0030-drops-191294
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode