2000 · 163 citations · 21 references
ComputingComputer ScienceCryptographyDistributed SystemsSecurity ProtocolsCryptographic Protocol DesignCryptographic ProtocolsKey Exchange ProtocolsMutual AuthenticationAgreement ProtocolsByzantine AgreementDiffie-hellman ProtocolsRandom Oracle ModelThreshold Signatures
Byzantine agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of cryptography, specifically of threshold signatures and coin-tossing protocols. These cryptographic protocols have practical and provably secure implementations in the “random oracle” model. In particular, a coin-tossing protocol based on the Diffie-Hellman problem is presented and analyzed.
21
Adi Shamir · Communications of the ACM · 1979 · 13.5K citations · Full text
Mihir Bellare, Phillip Rogaway · 1993 · 4.7K citations · Full text
Unreliable failure detectors for reliable distributed systems
Tushar Chandra, Sam Toueg · Journal of the ACM · 1996 · 2.5K citations · Full text