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

Ananya Appan; Anirudh Chandramouli; Ashish Choudhury

doi:10.1007/978-3-031-22912-1_10

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

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

International Institute of Information Technology Bangalore

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

1 Scopus citations

Abstract

In this paper, we present a perfectly-secure multi-party computation (MPC) protocol in the asynchronous communication setting with optimal resilience. Our protocol is secure against a computationally-unbounded malicious adversary characterized by an adversary structure Z, which enumerates all possible subsets of potentially corrupt parties. The protocol incurs an amortized communication of O(| Z| ²) bits per multiplication. This improves upon the previous best protocol of Choudhury and Pappu (INDOCRYPT 2020), which requires an amortized communication of O(| Z| ³) bits per multiplication. Previously, perfectly-secure MPC with amortized communication of O(| Z| ²) bits per multiplication was known only in the relatively simpler synchronous communication setting (Hirt and Tschudi, ASIACRYPT 2013).

Original language	English
Title of host publication	Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings
Editors	Takanori Isobe, Santanu Sarkar
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	223-248
Number of pages	26
ISBN (Print)	9783031229114
DOIs	https://doi.org/10.1007/978-3-031-22912-1_10
State	Published - 2022
Externally published	Yes
Event	23rd International Conference on Cryptology, INDOCRYPT 2022 - Kolkata, India Duration: 11 Dec 2022 → 14 Dec 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13774 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	23rd International Conference on Cryptology, INDOCRYPT 2022
Country/Territory	India
City	Kolkata
Period	11/12/22 → 14/12/22

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Keywords

Byzantine agreement
Byzantine faults
Multi-party computation
Non-threshold adversary
Privacy
Secret-sharing
Unconditional-security

Access to Document

10.1007/978-3-031-22912-1_10

Cite this

Appan, A., Chandramouli, A., & Choudhury, A. (2022). Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries. In T. Isobe, & S. Sarkar (Eds.), Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings (pp. 223-248). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13774 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-22912-1_10

Appan, Ananya ; Chandramouli, Anirudh ; Choudhury, Ashish. / Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries. Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings. editor / Takanori Isobe ; Santanu Sarkar. Springer Science and Business Media Deutschland GmbH, 2022. pp. 223-248 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3026053ba48d463e90434bf13a778a75,

title = "Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries",

abstract = "In this paper, we present a perfectly-secure multi-party computation (MPC) protocol in the asynchronous communication setting with optimal resilience. Our protocol is secure against a computationally-unbounded malicious adversary characterized by an adversary structure Z, which enumerates all possible subsets of potentially corrupt parties. The protocol incurs an amortized communication of O(| Z| 2) bits per multiplication. This improves upon the previous best protocol of Choudhury and Pappu (INDOCRYPT 2020), which requires an amortized communication of O(| Z| 3) bits per multiplication. Previously, perfectly-secure MPC with amortized communication of O(| Z| 2) bits per multiplication was known only in the relatively simpler synchronous communication setting (Hirt and Tschudi, ASIACRYPT 2013).",

keywords = "Byzantine agreement, Byzantine faults, Multi-party computation, Non-threshold adversary, Privacy, Secret-sharing, Unconditional-security",

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

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 23rd International Conference on Cryptology, INDOCRYPT 2022 ; Conference date: 11-12-2022 Through 14-12-2022",

year = "2022",

doi = "10.1007/978-3-031-22912-1_10",

language = "אנגלית",

isbn = "9783031229114",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "223--248",

editor = "Takanori Isobe and Santanu Sarkar",

booktitle = "Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings",

address = "גרמניה",

}

Appan, A, Chandramouli, A & Choudhury, A 2022, Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries. in T Isobe & S Sarkar (eds), Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13774 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 223-248, 23rd International Conference on Cryptology, INDOCRYPT 2022, Kolkata, India, 11/12/22. https://doi.org/10.1007/978-3-031-22912-1_10

Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries. / Appan, Ananya; Chandramouli, Anirudh; Choudhury, Ashish.
Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings. ed. / Takanori Isobe; Santanu Sarkar. Springer Science and Business Media Deutschland GmbH, 2022. p. 223-248 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13774 LNCS).

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

TY - GEN

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

AU - Appan, Ananya

AU - Chandramouli, Anirudh

AU - Choudhury, Ashish

PY - 2022

Y1 - 2022

N2 - In this paper, we present a perfectly-secure multi-party computation (MPC) protocol in the asynchronous communication setting with optimal resilience. Our protocol is secure against a computationally-unbounded malicious adversary characterized by an adversary structure Z, which enumerates all possible subsets of potentially corrupt parties. The protocol incurs an amortized communication of O(| Z| 2) bits per multiplication. This improves upon the previous best protocol of Choudhury and Pappu (INDOCRYPT 2020), which requires an amortized communication of O(| Z| 3) bits per multiplication. Previously, perfectly-secure MPC with amortized communication of O(| Z| 2) bits per multiplication was known only in the relatively simpler synchronous communication setting (Hirt and Tschudi, ASIACRYPT 2013).

AB - In this paper, we present a perfectly-secure multi-party computation (MPC) protocol in the asynchronous communication setting with optimal resilience. Our protocol is secure against a computationally-unbounded malicious adversary characterized by an adversary structure Z, which enumerates all possible subsets of potentially corrupt parties. The protocol incurs an amortized communication of O(| Z| 2) bits per multiplication. This improves upon the previous best protocol of Choudhury and Pappu (INDOCRYPT 2020), which requires an amortized communication of O(| Z| 3) bits per multiplication. Previously, perfectly-secure MPC with amortized communication of O(| Z| 2) bits per multiplication was known only in the relatively simpler synchronous communication setting (Hirt and Tschudi, ASIACRYPT 2013).

KW - Byzantine agreement

KW - Byzantine faults

KW - Multi-party computation

KW - Non-threshold adversary

KW - Privacy

KW - Secret-sharing

KW - Unconditional-security

UR - http://www.scopus.com/inward/record.url?scp=85147841481&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-22912-1_10

DO - 10.1007/978-3-031-22912-1_10

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

AN - SCOPUS:85147841481

SN - 9783031229114

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 223

EP - 248

BT - Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings

A2 - Isobe, Takanori

A2 - Sarkar, Santanu

PB - Springer Science and Business Media Deutschland GmbH

T2 - 23rd International Conference on Cryptology, INDOCRYPT 2022

Y2 - 11 December 2022 through 14 December 2022

ER -

Appan A, Chandramouli A, Choudhury A. Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries. In Isobe T, Sarkar S, editors, Progress in Cryptology – INDOCRYPT 2022 - 23rd International Conference on Cryptology in India, 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 223-248. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-22912-1_10

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

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this