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)
“Where dwells the religion? Tell me first where dwells electricity, or motion, or thought or gesture. They do not dwell or stay at all. Electricity cannot be made fast, mortared up and ended, like London Monument, or the Tower, so that you shall know where to find it, and keep it fixed, as the English do with their things, forevermore; it is passing, glancing, gesticular; it is a traveller, a newness, a surprise, a secret which perplexes them, and puts them out.”
—Ralph Waldo Emerson (1803–1882)
“To see ourselves as others see us can be eye-opening. To see others as sharing a nature with ourselves is the merest decency. But it is from the far more difficult achievement of seeing ourselves amongst others, as a local example of the forms human life has locally taken, a case among cases, a world among worlds, that the largeness of mind, without which objectivity is self- congratulation and tolerance a sham, comes.”
—Clifford Geertz (b. 1926)