A New PVSS Scheme with a Simple Encryption Function

TL;DR

This paper introduces a simplified PVSS scheme that maintains the same features as existing schemes, making the process easier without sacrificing functionality.

Contribution

The paper proposes a new PVSS scheme with a straightforward encryption function, improving simplicity while preserving key features of previous schemes.

Findings

The new scheme is simpler than existing PVSS schemes.

It retains explicit membership and disputation processes.

The scheme offers comparable security features.

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.