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)
“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)
“Don’t let him know she liked them best,
For this must ever be
A secret kept from all the rest,
Between yourself and me.”
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“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)