Proof-of-work-based consensus in expected-constant time

DOI10.1007/978-3-031-58734-4_4MaRDI QIDQ6637326

Aggelos Kiayias, Yu Shen, Juan Garay

Publication date: 13 November 2024

zbMATH Keywords

consensus problemByzantine agreementBitcoin

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Resource fairness and composability of cryptographic protocols
• SoK: a consensus taxonomy in the blockchain era
• A lower bound for the time to assure interactive consistency
• Verifiable delay functions
• The Bitcoin backbone protocol with chains of variable difficulty
• Bitcoin as a transaction ledger: a composable treatment
• Bootstrapping the blockchain, with applications to consensus and fast PKI setup
• Security and composition of multiparty cryptographic protocols
• Ledger combiners for fast settlement
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
• Algorand: a secure and efficient distributed ledger
• Probabilistic Termination and Composability of Cryptographic Protocols
• Efficient player-optimal protocols for strong and differential consensus
• The Bitcoin Backbone Protocol: Analysis and Applications
• Authenticated Algorithms for Byzantine Agreement
• PoW-Based Distributed Cryptography with No Trusted Setup
• Early stopping in Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Time, clocks, and the ordering of events in a distributed system
• Universally Composable Synchronous Computation
• Fully polynomial Byzantine agreement in t + 1 rounds
• Analysis of the Blockchain Protocol in Asynchronous Networks
• FruitChains
• On Expected Constant-Round Protocols for Byzantine Agreement

Related Items (1)

Round efficient Byzantine agreement from VDFs

This page was built for publication: Proof-of-work-based consensus in expected-constant time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637326)