Verifiable Secret Sharing
In cryptography, a secret sharing scheme is verifiable if auxiliary information is included that allows players to verify their shares as consistent. More formally, verifiable secret sharing ensures that even if the dealer is malicious there is a well-defined secret that the players can later reconstruct. (In standard secret sharing, the dealer is assumed to be honest.) The concept of verifiable secret sharing (VSS) was first introduced in 1985 by Benny Chor, Shafi Goldwasser, Silvio Micali and Baruch Awerbuch.
In a VSS protocol a distinguished player who wants to share the secret is referred to as the dealer. The protocol consists of two phases: a sharing phase and a reconstruction phase.
Sharing: Initially the dealer holds secret as input and each player holds an independent random input. The sharing phase may consist of several rounds. At each round each player can privately send messages to other players and it can also broadcast a message. Each message sent or broadcast by a player is determined by its input, its random input and messages received from other players in previous rounds.
Reconstruction: In this phase each player provides its entire view from the sharing phase and a reconstruction function is applied and is taken as the protocol's output.
An alternative definition given by Oded Goldreich defines VSS as a secure multi-party protocol for computing the randomized functionality corresponding to some (non-verifiable) secret sharing scheme. This definition is stronger than that of the other definitions and is very convenient to use in the context of general secure multi-party computation.
Verifiable secret sharing is important for secure multiparty computation. Multiparty computation is typically accomplished by making secret shares of the inputs, and manipulating the shares to compute some function. To handle "active" adversaries (that is, adversaries that corrupt nodes and then make them deviate from the protocol), the secret sharing scheme needs to be verifiable to prevent the deviating nodes from throwing off the protocol.
Read more about Verifiable Secret Sharing: Feldman’s Scheme, Benaloh’s Scheme, Secret Ballot Elections, Round-Optimal and Efficient Verifiable Secret Sharing
Famous quotes containing the words verifiable, secret and/or sharing:
“The entire construct of the “medical model” of “mental illness”Mwhat is it but an analogy? Between physical medicine and psychiatry: the mind is said to be subject to disease in the same manner as the body. But whereas in physical medicine there are verifiable physiological proofs—in damaged or affected tissue, bacteria, inflammation, cellular irregularity—in mental illness alleged socially unacceptable behavior is taken as a symptom, even as proof, of pathology.”
—Kate Millett (b. 1934)
“Everything human is pathetic. The secret source of Humor itself is not joy but sorrow. There is no humor in heaven.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)
“We fight our way through the massed and leveled collective safe taste of the Top 40, just looking for a little something we can call our own. But when we find it and jam the radio to hear it again it isn’t just ours—it is a link to thousands of others who are sharing it with us. As a matter of a single song this might mean very little; as culture, as a way of life, you can’t beat it.”
—Greil Marcus (b. 1945)