1989/01/01 by Tal Rabin, Michael Ben-Or · 3 citations
Computer Science · #Cryptography and Data Security #Privacy-Preserving Technologies in Data #Complexity and Algorithms in Graphs
paper · pdf · doi:10.1145/73007.73014
openalex publication_date 1989/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
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 are also presented.