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:
“I make no secret of the fact that I would rather lie on a sofa than sweep beneath it. But you have to be efficient if you’re going to be lazy.”
—Shirley Conran (b. 1932)
“Man associates ideas not according to logic or verifiable exactitude, but according to his pleasure and interests. It is for this reason that most truths are nothing but prejudices.”
—Rémy De Gourmont (1858–1915)
“The secret of a long life is knowing when it’s time to go.”
—Michele Shocked (b. 1962)
“It is easy to see that what is best written or done by genius in the world, was no man’s work but came by wide social labor, when a thousand wrought like one, sharing the same impulse.”
—Ralph Waldo Emerson (1803–1882)