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)
“But whenever you pray, go into your room and shut the door and pray to your Father who is in secret; and your Father who sees in secret will reward you.”
—Bible: New Testament, Matthew 6:6.
Jesus.
“However intense my experience, I am conscious of the presence and criticism of a part of me, which, as it were, is not a part of me, but a spectator, sharing no experience, but taking note of it, and that is no more I than it is you. When the play, it may be the tragedy, of life is over, the spectator goes his way. It was a kind of fiction, a work of the imagination only, so far as he was concerned.”
—Henry David Thoreau (1817–1862)