Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Ananya Appan; Anirudh Chandramouli; Ashish Choudhury

doi:10.1145/3519270.3538417

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

International Institute of Information Technology Bangalore

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

Abstract

Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. The optimal resilience for perfectly-secure MPC in synchronous and asynchronous networks is t < n/3 and t < n/4 respectively, where n is the number of parties and t is the number of corruptions. A natural question is whether there exists a protocol tolerating ts < n/3 corruptions in a synchronous network and ta < n/4 corruptions in an asynchronous network. We design such a protocol, if 3ts + ta < n. For our protocol, we present a perfectly-secure Byzantine agreement (BA) protocol, tolerating t < n/3 corruptions in any network and a perfectly-secure verifiable secret-sharing (VSS) protocol, tolerating ts and ta corruptions in a synchronous and an asynchronous network respectively.

Original language	English
Title of host publication	PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	92-102
Number of pages	11
ISBN (Electronic)	9781450392624
DOIs	https://doi.org/10.1145/3519270.3538417
State	Published - 20 Jul 2022
Externally published	Yes
Event	41st ACM Symposium on Principles of Distributed Computing, PODC 2022 - Salerno, Italy Duration: 25 Jul 2022 → 29 Jul 2022

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	41st ACM Symposium on Principles of Distributed Computing, PODC 2022
Country/Territory	Italy
City	Salerno
Period	25/07/22 → 29/07/22

Bibliographical note

Publisher Copyright:
© 2022 ACM.

Funding

∗This is an extended abstract. The full version of the paper, with proofs, is available at https://eprint.iacr.org/2022/109.pdf †This research is an outcome of the R&D work undertaken in the project under the Visvesvaraya PhD Scheme of Ministry of Electronics & Information Technology, Government of India, being implemented by Digital India Corporation (formerly Media Lab Asia). The author is also thankful to the Electronics, IT & BT Government of Karnataka for supporting this work under the CIET project.

Keywords

byzantine agreement
secret-sharing
unconditional-security

Access to Document

10.1145/3519270.3538417

Cite this

Appan, A., Chandramouli, A., & Choudhury, A. (2022). Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. In PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (pp. 92-102). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Association for Computing Machinery. https://doi.org/10.1145/3519270.3538417

@inproceedings{b263971b1687475fb9aa35de7175db5c,

title = "Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees",

abstract = "Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. The optimal resilience for perfectly-secure MPC in synchronous and asynchronous networks is t < n/3 and t < n/4 respectively, where n is the number of parties and t is the number of corruptions. A natural question is whether there exists a protocol tolerating ts < n/3 corruptions in a synchronous network and ta < n/4 corruptions in an asynchronous network. We design such a protocol, if 3ts + ta < n. For our protocol, we present a perfectly-secure Byzantine agreement (BA) protocol, tolerating t < n/3 corruptions in any network and a perfectly-secure verifiable secret-sharing (VSS) protocol, tolerating ts and ta corruptions in a synchronous and an asynchronous network respectively.",

keywords = "byzantine agreement, secret-sharing, unconditional-security",

author = "Ananya Appan and Anirudh Chandramouli and Ashish Choudhury",

note = "Publisher Copyright: {\textcopyright} 2022 ACM.; 41st ACM Symposium on Principles of Distributed Computing, PODC 2022 ; Conference date: 25-07-2022 Through 29-07-2022",

year = "2022",

month = jul,

day = "20",

doi = "10.1145/3519270.3538417",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "92--102",

booktitle = "PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing",

}

Appan, A, Chandramouli, A & Choudhury, A 2022, Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. in PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 92-102, 41st ACM Symposium on Principles of Distributed Computing, PODC 2022, Salerno, Italy, 25/07/22. https://doi.org/10.1145/3519270.3538417

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. / Appan, Ananya; Chandramouli, Anirudh; Choudhury, Ashish.
PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2022. p. 92-102 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

AU - Appan, Ananya

AU - Chandramouli, Anirudh

AU - Choudhury, Ashish

PY - 2022/7/20

Y1 - 2022/7/20

N2 - Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. The optimal resilience for perfectly-secure MPC in synchronous and asynchronous networks is t < n/3 and t < n/4 respectively, where n is the number of parties and t is the number of corruptions. A natural question is whether there exists a protocol tolerating ts < n/3 corruptions in a synchronous network and ta < n/4 corruptions in an asynchronous network. We design such a protocol, if 3ts + ta < n. For our protocol, we present a perfectly-secure Byzantine agreement (BA) protocol, tolerating t < n/3 corruptions in any network and a perfectly-secure verifiable secret-sharing (VSS) protocol, tolerating ts and ta corruptions in a synchronous and an asynchronous network respectively.

AB - Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. The optimal resilience for perfectly-secure MPC in synchronous and asynchronous networks is t < n/3 and t < n/4 respectively, where n is the number of parties and t is the number of corruptions. A natural question is whether there exists a protocol tolerating ts < n/3 corruptions in a synchronous network and ta < n/4 corruptions in an asynchronous network. We design such a protocol, if 3ts + ta < n. For our protocol, we present a perfectly-secure Byzantine agreement (BA) protocol, tolerating t < n/3 corruptions in any network and a perfectly-secure verifiable secret-sharing (VSS) protocol, tolerating ts and ta corruptions in a synchronous and an asynchronous network respectively.

KW - byzantine agreement

KW - secret-sharing

KW - unconditional-security

UR - https://www.scopus.com/pages/publications/85135308353

U2 - 10.1145/3519270.3538417

DO - 10.1145/3519270.3538417

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85135308353

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 92

EP - 102

BT - PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 41st ACM Symposium on Principles of Distributed Computing, PODC 2022

Y2 - 25 July 2022 through 29 July 2022

ER -

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this