ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A Survey on Perfectly Secure Verifiable Secret-sharing

Chandramouli, A and Choudhury, A and Patra, A (2022) A Survey on Perfectly Secure Verifiable Secret-sharing. In: ACM Computing Surveys, 54 (11s).

acm_com_sur_54-11_2022.pdf - Published Version

Download (5MB) | Preview
Official URL: https://doi.org/10.1145/3512344


Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure distributed computing. It is used as a building block in several distributed computing tasks, such as Byzantine agreement and secure multi-party computation. In this article, we consider VSS schemes with perfect security, tolerating computationally unbounded adversaries. We comprehensively survey the existing perfectly secure VSS schemes in three different communication settings, namely, synchronous, asynchronous, and hybrid setting and provide full details of the existing schemes in these settings. The aim of this survey is to provide a clear knowledge and foundation to researchers who are interested in knowing and extending the state-of-the-art perfectly secure VSS schemes. © 2022 Association for Computing Machinery.

Item Type: Journal Article
Publication: ACM Computing Surveys
Publisher: Association for Computing Machinery
Additional Information: The copyright for this article belongs to the Authors.
Keywords: Asynchronous networks; Building blockes; Byzantine Agreement; Byzantine corruption; Computing-task; Secret-sharing; Secure multi-party computation; Synchronous networks; Verifiable secret sharing; Verifiable secret sharing scheme, Distributed computer systems
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 25 Apr 2023 05:15
Last Modified: 25 Apr 2023 05:15
URI: https://eprints.iisc.ac.in/id/eprint/81274

Actions (login required)

View Item View Item