pith. sign in

arxiv: 1307.8209 · v1 · pith:MSXPIE3Nnew · submitted 2013-07-31 · 💻 cs.CR

A New PVSS Scheme with a Simple Encryption Function

classification 💻 cs.CR
keywords pvssschemeadvantageallowsanyonebehnadcomputeddealer
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.