Ouroboros: a provably secure proof-of-stake blockchain protocol

DOI10.1007/978-3-319-63688-7_12zbMath1407.94128OpenAlexW2739845435WikidataQ113989495 ScholiaQ113989495MaRDI QIDQ1675731

Alexander Russell, Roman Oliynykov, Aggelos Kiayias, Bernardo David

Publication date: 3 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_12

Related Items (58)

Consensus in Data Management: From Distributed Commit to Blockchain ⋮ Game-theoretic fairness meets multi-party protocols: the case of leader election ⋮ A rational protocol treatment of 51\% attacks ⋮ Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions ⋮ Mining for privacy: how to bootstrap a snarky blockchain ⋮ SoK: communication across distributed ledgers ⋮ Instant block confirmation in the sleepy model ⋮ PoSAT: proof-of-work availability and unpredictability, without the work ⋮ Fraud and data availability proofs: detecting invalid blocks in light clients ⋮ Proof-of-reputation blockchain with Nakamoto fallback ⋮ On the bit security of cryptographic primitives ⋮ Soft power: upgrading chain macroeconomic policy through soft forks ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ The availability-accountability dilemma and its resolution via accountability gadgets ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ Algorand: a secure and efficient distributed ledger ⋮ Permissionless and asynchronous asset transfer ⋮ Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol ⋮ Formalizing delayed adaptive corruptions and the security of flooding networks ⋮ Multidimensional Byzantine agreement in a synchronous setting ⋮ WOTSwana: a generalized $\mathcal{S}_{\mathrm{ leeve }}$ construction for multiple proofs of ownership ⋮ SNACKs: leveraging proofs of sequential work for blockchain light clients ⋮ High Performance, Low Energy, and Trustworthy Blockchains Using Satellites ⋮ Tweakable $$\mathcal {S}_{\text{ leeve }}$$: A Novel $$\mathcal {S}_{\text{ leeve }}$$ Construction Based on Tweakable Hash Functions ⋮ Consensus on demand ⋮ Snarky ceremonies ⋮ On elapsed time consensus protocols ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Decentralizing information technology: the advent of resource based systems ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery ⋮ Practical settlement bounds for longest-chain consensus ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ Divide \& Scale: formalization and roadmap to robust sharding ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Proofs about Network Communication: For Humans and Machines ⋮ ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing ⋮ Turn-based communication channels ⋮ Bankrupting Sybil despite churn ⋮ Security of the blockchain against long delay attack ⋮ Oceanic Games: Centralization Risks and Incentives in Blockchain Mining ⋮ Minting mechanism for proof of stake blockchains ⋮ Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era ⋮ Dirac-based reduction techniques for quantitative analysis of discrete-time Markov models ⋮ Unnamed Item ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Aggregatable distributed key generation ⋮ Dynamic ad hoc clock synchronization ⋮ Abuse resistant law enforcement access systems ⋮ Proofs of Catalytic Space ⋮ Correctness of Tendermint-Core Blockchains ⋮ Interactive verification of architectural design patterns in FACTum ⋮ FAST: fair auctions via secret transactions ⋮ Order-fairness for Byzantine consensus ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era

This page was built for publication: Ouroboros: a provably secure proof-of-stake blockchain protocol