Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)

  title={Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)},
  author={Tal Rabin and Michael Ben-Or},
Under the assumption that each participant can broadcast a message to all other participants and that each pair of participants can communicate secretly, we present a verifiable secret sharing protocol, and show that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest. The secrecy achieved is unconditional and does not rely on any assumption about computational intractability. Applications of these results to Byzantine Agreement… CONTINUE READING
Highly Influential
This paper has highly influenced 70 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 895 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


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

Almost Optimum t-Cheater Identifiable Secret Sharing Schemes

View 8 Excerpts
Highly Influenced

Network Oblivious Transfer

IACR Cryptology ePrint Archive • 2016
View 5 Excerpts
Highly Influenced

Stabilization, Safety, and Security of Distributed Systems

Lecture Notes in Computer Science • 2014
View 8 Excerpts
Highly Influenced

896 Citations

Citations per Year
Semantic Scholar estimates that this publication has 896 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…