A New PVSS Scheme with a Simple Encryption Function

Assia Ben Shil
(LIP2 Laboratory, Faculty of Sciences of Tunis,Tunisia)
Kaouther Blibech
(LIP2 Laboratory, Faculty of Sciences of Tunis,Tunisia)
Riadh Robbana
(LIP2 Laboratory, Faculty of Sciences of Tunis,Tunisia)
Wafa Neji
(LIP2 Laboratory, Faculty of Sciences of Tunis,Tunisia)

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.

In Adel Bouhoula, Tetsuo Ida and Fairouz Kamareddine: Proceedings Fourth International Symposium on Symbolic Computation in Software Science (SCSS 2012), Gammarth, Tunisia, 15-17 December 2012, Electronic Proceedings in Theoretical Computer Science 122, pp. 11–22.
This PVSS scheme was proposed to be used to provide a distributed Timestamping scheme.
Published: 30th July 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.122.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org