Round-Optimal and Efficient Verifiable Secret Sharing

@inproceedings{Fitzi2006RoundOptimalAE,
  title={Round-Optimal and Efficient Verifiable Secret Sharing},
  author={Matthias Fitzi and Juan A. Garay and Shyamnath Gollakota and C. Pandu Rangan and K. Srinathan},
  booktitle={TCC},
  year={2006}
}
We consider perfect verifiable secret sharing (VSS) in a synchronous network of n processors (players) where a designated player called the dealer wishes to distribute a secret s among the players in a way that no t of them obtain any information, but any t + 1 players obtain full information about the secret. The round complexity of a VSS protocol is defined as the number of rounds performed in the sharing phase. Gennaro, Ishai, Kushilevitz and Rabin showed that three rounds are necessary and… CONTINUE READING

From This Paper

Topics from this paper.
47 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 47 extracted citations

Similar Papers

Loading similar papers…