Cryptology ePrint Archive: Report 2021/445

A Survey on Perfectly-Secure Verifiable Secret-Sharing

Anirudh C and 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.

Category / Keywords: cryptographic protocols / Secret sharing, round complexity, Byzantine corruption

Date: received 6 Apr 2021

Contact author: anirudh c at iiitb ac in, ashish choudhury at iiitb ac in, arpita at iisc ac in

Available format(s): PDF | BibTeX Citation

Version: 20210408:122119 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]