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.

翻译：在安全分布式计算中,可以保密秘密分享(VSS)是基本原始的,作为若干分散计算任务的基础,例如拜占庭协议和多党安全计算。在本篇文章中,我们认为VSS计划是完全安全的,可以容忍没有限制的计算对手。我们在三个不同的通信环境中,即同步的、不同步的和混合的设置中,全面调查现有的完全安全的VSS计划,并提供这些环境中现有计划的全部细节。本调查的目的是为有兴趣了解和扩大最先进的VSS计划的研究人员提供一个明确的知识和基础。