Practical settlement bounds for longest-chain consensus

DOI10.1007/978-3-031-38557-5_4MaRDI QIDQ6186589FDO

Authors Peter Gaži, Ling Ren, Alexander Russell

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

zbMATH Keywords

Bitcoinproof-of-work protocols

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical economics (91B99)

Recommendations

• Weight-based Nakamoto-style blockchains
• Proof-of-work-based consensus in expected-constant time
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Security of the blockchain against long delay attack
• Analysis of the Blockchain Protocol in Asynchronous Networks

Cites work

• Majority is not enough: bitcoin mining is vulnerable
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• The Bitcoin Backbone Protocol: Analysis and Applications
• The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains
• The part-time parliament

This page was built for publication: Practical settlement bounds for longest-chain consensus

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