Paper 2023/1196
Verifiable Secret Sharing Simplified
Abstract
Verifiable Secret Sharing (VSS) is a fundamental building block in cryptography. Despite its importance and extensive studies, existing VSS protocols are often complex and inefficient. Many of them do not support dual thresholds, are not publicly verifiable, or do not properly terminate in asynchronous networks. This paper presents a new and simple approach for designing VSS protocols in synchronous and asynchronous networks. Our VSS protocols are optimally fault-tolerant, i.e., they tolerate a
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. IEEE S&P 2025
- Keywords
- Verifiable Secret SharingThreshold CryptographyVSS
- Contact author(s)
-
souravd2 @ illinois edu
xiangzhuolun @ gmail com
tomescu alin @ gmail com
sasha spiegelman @ gmail com
benny @ pinkas net
renling @ illinois edu - History
- 2024-10-12: last of 3 revisions
- 2023-08-06: received
- See all versions
- Short URL
- https://ia.cr/2023/1196
- License
-
CC0
BibTeX
@misc{cryptoeprint:2023/1196, author = {Sourav Das and Zhuolun Xiang and Alin Tomescu and Alexander Spiegelman and Benny Pinkas and Ling Ren}, title = {Verifiable Secret Sharing Simplified}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1196}, year = {2023}, url = {https://eprint.iacr.org/2023/1196} }