Network Agnostic Perfectly Secure MPC Against General Adversaries

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this work, we study perfectly-secure multi-party computation (MPC) against general (non-threshold) adversaries. Known protocols are secure against Q(3) and Q(4) adversary structures in a synchronous and an asynchronous network respectively. We address the existence of 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 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.

Original languageEnglish
Title of host publication37th International Symposium on Distributed Computing, DISC 2023
EditorsRotem Oshman
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773010
DOIs
StatePublished - Oct 2023
Event37th International Symposium on Distributed Computing, DISC 2023 - L'Aquila, Italy
Duration: 10 Oct 202312 Oct 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume281
ISSN (Print)1868-8969

Conference

Conference37th International Symposium on Distributed Computing, DISC 2023
Country/TerritoryItaly
CityL'Aquila
Period10/10/2312/10/23

Bibliographical note

Publisher Copyright:
© Ananya Appan, Anirudh Chandramouli, and Ashish Choudhury; licensed under Creative Commons License CC-BY 4.0.

Funding

Supported by the Israel Science Foundation (grant No. 2439/20). 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. Funding Anirudh Chandramouli: Supported by the Israel Science Foundation (grant No. 2439/20). Ashish Choudhury: 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.

FundersFunder number
Digital India Corporation
Israel Science Foundation2439/20
Ministry of Electronics and Information technology

    Keywords

    • Byzantine Agreement
    • Perfect Security
    • Verifiable Secret Sharing

    Fingerprint

    Dive into the research topics of 'Network Agnostic Perfectly Secure MPC Against General Adversaries'. Together they form a unique fingerprint.

    Cite this