Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography

Christian Cachin, Klaus Kursawe, Victor Shoup

Research output: Contribution to conferencePaper

Abstract

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. The resulting asynchronous Byzantine agreement protocol is both practical and nearly matches the known theoretical lower bounds. More precisely, it tolerates the maximum number of corrupted parties, runs in constant expected time, has message and communication complexity close to the maximum, and uses a trusted dealer only in a setup phase, after which it can process a virtually unlimited number of transactions. Novel dual-threshold variants of both cryptographic protocols are used. The protocol is formulated as a transaction processing service in a cryptographic security model, which differs from the standard information-theoretic formalization and may be of independent interest.

Original languageEnglish (US)
Pages123-132
Number of pages10
StatePublished - 2000
Event19th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, USA
Duration: Jul 16 2000Jul 19 2000

Other

Other19th Annual ACM Symposium on Principles of Distributed Computing
CityPortland, OR, USA
Period7/16/007/19/00

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography'. Together they form a unique fingerprint.

  • Cite this

    Cachin, C., Kursawe, K., & Shoup, V. (2000). Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography. 123-132. Paper presented at 19th Annual ACM Symposium on Principles of Distributed Computing, Portland, OR, USA, .