Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
From MaRDI portal
Publication:1648822
DOI10.1007/978-3-319-78375-8_3zbMath1423.94066OpenAlexW2795222609MaRDI QIDQ1648822
Bernardo David, Peter Gaži, Aggelos Kiayias, Alexander Russell
Publication date: 9 July 2018
Full work available at URL: https://eprint.iacr.org/2017/573
Related Items (45)
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 ⋮ Fine-grained forward secrecy: allow-list/deny-list encryption and applications ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Proof-of-reputation blockchain with Nakamoto fallback ⋮ The availability-accountability dilemma and its resolution via accountability gadgets ⋮ Permissionless consensus in the resource model ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Classical and quantum security of elliptic curve VRF, via relative indifferentiability ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ Algorand: a secure and efficient distributed ledger ⋮ Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol ⋮ Formalizing delayed adaptive corruptions and the security of flooding networks ⋮ A composable security treatment of ECVRF and batch verifications ⋮ WOTSwana: a generalized \(\mathcal{S}_{\mathrm{ leeve }}\) construction for multiple proofs of ownership ⋮ YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model ⋮ Practical provably secure flooding for blockchains ⋮ SNACKs: leveraging proofs of sequential work for blockchain light clients ⋮ Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees ⋮ Tweakable $$\mathcal {S}_{\text{ leeve }}$$: A Novel $$\mathcal {S}_{\text{ leeve }}$$ Construction Based on Tweakable Hash Functions ⋮ On elapsed time consensus protocols ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Post-quantum verifiable random function from symmetric primitives in PoS blockchain ⋮ Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery ⋮ Maravedí: a secure and practical protocol to trade risk for instantaneous finality ⋮ Practical settlement bounds for longest-chain consensus ⋮ Divide \& Scale: formalization and roadmap to robust sharding ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Proofs about Network Communication: For Humans and Machines ⋮ ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing ⋮ Non-malleable time-lock puzzles and applications ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Security of the blockchain against long delay attack ⋮ Minting mechanism for proof of stake blockchains ⋮ Dynamic ad hoc clock synchronization ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Abuse resistant law enforcement access systems ⋮ Verifiable random functions with optimal tightness ⋮ FAST: fair auctions via secret transactions ⋮ Appointed learning for the common good: optimal committee size and monetary transfers ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
This page was built for publication: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
