Polynomial Commitment with a One-to-Many Prover and Applications presented at USENIX Security 2022

by Jiaheng Xie,

Tags: Crypto V: Provers & Shuffling

URL : https://www.usenix.org/system/files/sec22-zhang-jiaheng.pdf

Summary : Verifiable Secret Sharing (VSS) is a foundational cryptographic primitive that serves as an essential building block in multi-party computation and decentralized blockchain applications. One of the most practical ways to construct VSS is through a polynomial commitment, where the dealer commits to a random polynomial whose 0-th coefficient encodes the secret to be shared, and proves the evaluation of the committed polynomial at a different point to each of N verifiers, i.e., the polynomial commitment is used in a "one-to-many" fashion.