Paper 2021/445

A Survey on Perfectly-Secure Verifiable Secret-Sharing

Anirudh Chandramouli, Ashish Choudhury, and Arpita Patra

Abstract

Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure distributed computing. It is used as an important building block in several distributed computing tasks, such as Byzantine agreement and secure multi-party computation. VSS has been widely studied in various dimensions over the last three decades and several important results have been achieved related to the fault-tolerance, round-complexity and communication efficiency of VSS schemes. 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 settings, namely synchronous, asynchronous and hybrid communication settings and provide the full details of each 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. Minor revision.
Keywords
Secret sharinground complexityByzantine corruption
Contact author(s)
anirudh c @ iiitb ac in
ashish choudhury @ iiitb ac in
arpita @ iisc ac in
History
2022-02-04: last of 3 revisions
2021-04-08: received
See all versions
Short URL
https://ia.cr/2021/445
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/445,
      author = {Anirudh Chandramouli and Ashish Choudhury and Arpita Patra},
      title = {A Survey on Perfectly-Secure Verifiable Secret-Sharing},
      howpublished = {Cryptology ePrint Archive, Paper 2021/445},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/445}},
      url = {https://eprint.iacr.org/2021/445}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.