Loading...
Search for:
verifiable-secret-sharing
0.005 seconds
A new, publicly verifiable, secret sharing scheme
, Article Scientia Iranica ; Volume 15, Issue 2 , 2008 , Pages 246-251 ; 10263098 (ISSN) ; Eghlidos, T ; Sharif University of Technology
Sharif University of Technology
2008
Abstract
A Publicly Verifiable Secret Sharing (PVSS) scheme, as introduced by Stadler, has a feature where anyone, besides the participants, can verify the validity of the shares distributed by the dealer. Schoenmakers added a new feature, by providing a proof of correctness of the shares released by the players in the reconstruction process. This protocol is claimed to be an improvement on Stadler's and Fujisaki-Okamoto's, both in efficiency and in the type of intractability assumptions. However, Young-Yung improved Schoenmakers' PVSS, using a Discrete-Log instead of a Decision Diffie-Hellman. In this paper, a new PVSS is presented, having an intrinsic difference with its predecessors, that is, the...
Broadcast Efficient Verifiable Secret Sharing
, M.Sc. Thesis Sharif University of Technology ; Izadi, Mohammad (Supervisor)
Abstract
Verifiable secret sharing (VSS) is one of the basic problems in the theory of distributed cryptography and has important role in secure multi-party computation. In this case, it is tried to share a confidential data as secret, between multiple nodes in a distributed system, in the presence of an active adversary that can destroy a number of nodes, such that the secret can be reconstructed with the participation of certain size of honest nodes. There are two types of active adversary; Static and dynamic which the latter can change it’s corrupted nodes among the protocol. VSS protocols have different types of algorithmic complexity and one of these definitions, is the use of broadcast channel...