2013/07/30 by Assia Ben Shil, Kaouther Blibech, Riadh Robbana +1 · 1 citation
Computer Science · Mathematics · #Advanced Authentication Protocols Security #Blockchain Technology Applications and Security #Computer science #Cryptography and Data Security #Epistemology #Logarithm #Mathematical analysis #Mathematics #Philosophy #Scheme (mathematics) #Simple (philosophy) #Verifiable secret sharing #cs.CR
paper · pdf · doi:10.4204/eptcs.122.2
published in Electronic Proceedings in Theoretical Computer Science 122, 11-22 (Open Publishing Association) · In Proceedings SCSS 2012, arXiv:1307.8029. This PVSS scheme was proposed to be used to provide a distributed Timestamping scheme
openalex publication_date 2013/07/30 · arxiv created 2013/07/31 · arxiv updated 2013/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/08
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.