Detectable byzantine agreement secure against faulty majorities (original) (raw)

Proceedings of the twenty-first annual symposium on Principles of distributed computing - PODC '02, 2002

Abstract

It is well-known that n players, connected only by pairwise secure channels, can achieve Byzantine agreement only if the number t of cheaters satisfies t < n/3, even with respect to computa-tional security. However, for many applications it is sufficient to achieve detectable broadcast. ...

Adam Smith hasn't uploaded this paper.

Create a free Academia account to let Adam Smith know you want this paper to be uploaded.

Ask for this paper to be uploaded.