Algorand: a secure and efficient distributed ledger

DOI10.1016/j.tcs.2019.02.001zbMath1423.68152OpenAlexW2914554654MaRDI QIDQ2422025

Jing Chen, Silvio Micali

Publication date: 18 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.02.001

zbMATH Keywords

Byzantine agreementdistributed computationblockchaincryptographic self-selectionpermissionless systempublic ledger

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Related Items (24)

YOSO: You only speak once. Secure MPC with stateless ephemeral roles ⋮ Fluid MPC: secure multiparty computation with dynamic participants ⋮ A rational protocol treatment of 51\% attacks ⋮ A formal model of Algorand smart contracts ⋮ Instant block confirmation in the sleepy model ⋮ Round-optimal Byzantine agreement ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ The availability-accountability dilemma and its resolution via accountability gadgets ⋮ Complete characterization of broadcast and pseudo-signatures from correlations ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Classical and quantum security of elliptic curve VRF, via relative indifferentiability ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ Permissionless and asynchronous asset transfer ⋮ Multidimensional Byzantine agreement in a synchronous setting ⋮ Practical provably secure flooding for blockchains ⋮ Market Equilibria and Risk Diversification in Blockchain Mining Economies ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Completeness theorems for adaptively secure broadcast ⋮ Perfect MPC over layered graphs ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Dynamic ad hoc clock synchronization ⋮ Proofs of Catalytic Space

Cites Work

• On expected constant-round protocols for Byzantine agreement
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• The sleepy model of consensus
• Inclusive Block Chain Protocols
• Identity-Based Cryptosystems and Signature Schemes
• Authenticated Algorithms for Byzantine Agreement
• Byzantine Agreement in Expected Polynomial Time
• Impossibility of distributed consensus with one faulty process
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Reaching Agreement in the Presence of Faults
• The Byzantine generals strike again
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Analysis of the Blockchain Protocol in Asynchronous Networks
• FruitChains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorand: a secure and efficient distributed ledger