Round-Optimal and Efficient Verifiable Secret Sharing
The round complexity of a VSS protocol is defined as the number of communication rounds in its sharing phase; reconstruction can always be done in a single round. There is no 1-round VSS with t > 1, regardless of the number of players. The bounds on perfect and efficient VSS protocols is given below.
| Number of rounds | Security |
|---|---|
| 1 | t = 1, n > 4 |
| 2 | n > 4t |
| 3 | n > 3t |
Read more about this topic: Verifiable Secret Sharing
Famous quotes containing the words efficient, verifiable, secret and/or sharing:
“The truly efficient laborer will not crowd his day with work, but will saunter to his task, surrounded by a wide halo of ease and leisure, and then do but what he loves best. He is anxious only about the fruitful kernels of time.”
—Henry David Thoreau (1817–1862)
“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)
“I am going to my own hearthstone,
Bosom’d in yon green hills alone—
A secret nook in a pleasant land,”
—Ralph Waldo Emerson (1803–1882)
“The traditional American husband and father had the responsibilities—and the privileges—of playing the role of primary provider. Sharing that role is not easy. To yield exclusive access to the role is to surrender some of the potential for fulfilling the hero fantasy—a fantasy that appeals to us all. The loss is far from trivial.”
—Faye J. Crosby (20th century)