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...
Cataloging briefBroadcast 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...
Find in contentBookmark |
|