License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2023.3
URN: urn:nbn:de:0030-drops-191294
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19129/
Appan, Ananya ;
Chandramouli, Anirudh ;
Choudhury, Ashish
Network Agnostic Perfectly Secure MPC Against General Adversaries
Abstract
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.
BibTeX - Entry
@InProceedings{appan_et_al:LIPIcs.DISC.2023.3,
author = {Appan, Ananya and Chandramouli, Anirudh and Choudhury, Ashish},
title = {{Network Agnostic Perfectly Secure MPC Against General Adversaries}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/19129},
URN = {urn:nbn:de:0030-drops-191294},
doi = {10.4230/LIPIcs.DISC.2023.3},
annote = {Keywords: Verifiable Secret Sharing, Byzantine Agreement, Perfect Security}
}
Keywords: |
|
Verifiable Secret Sharing, Byzantine Agreement, Perfect Security |
Collection: |
|
37th International Symposium on Distributed Computing (DISC 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
05.10.2023 |