A New PVSS Scheme with a Simple Encryption Function
This work provides a more efficient solution for secure secret sharing in cryptographic applications, though it is incremental as it builds on prior PVSS schemes.
The paper tackles the problem of designing a simpler Publicly Verifiable Secret Sharing (PVSS) scheme, resulting in a new scheme that maintains the same features as existing ones but with reduced complexity.
A Publicly Verifiable Secret Sharing (PVSS) scheme allows anyone to verify the validity of the shares computed and distributed by a dealer. The idea of PVSS was introduced by Stadler in [18] where he presented a PVSS scheme based on Discrete Logarithm. Later, several PVSS schemes were proposed. In [2], Behnad and Eghlidos present an interesting PVSS scheme with explicit membership and disputation processes. In this paper, we present a new PVSS having the advantage of being simpler while offering the same features.