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:
“As machines become more and more efficient and perfect, so it will become clear that imperfection is the greatness of man.”
—Ernst Fischer (1899–1972)
“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)
“Just walking around,
An object of curiosity to some,
But you are too preoccupied
By the secret smudge in the back of your soul
To say much, and wander around,
Smiling to yourself and others.”
—John Ashbery (b. 1927)
“If then there is any encouragement in Christ, any consolation from love, any sharing in the Spirit, any compassion and sympathy, make my joy complete: be of the same mind, having the same love, being in full accord and of one mind.”
—Bible: New Testament, Philippians 2:1-2.