Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
From MaRDI portal
Publication:1648822
DOI10.1007/978-3-319-78375-8_3zbMATH Open1423.94066OpenAlexW2795222609MaRDI QIDQ1648822FDOQ1648822
Authors: 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
Recommendations
Cited In (56)
- Fair delivery of decentralised randomness beacon
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- Taming adaptivity in YOSO protocols: the modular way
- Asymptotically optimal message dissemination with applications to blockchains
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- MUSEN: aggregatable key-evolving verifiable random functions and applications
- Appointed learning for the common good: optimal committee size and monetary transfers
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
- Account management in proof of stake ledgers
- A composable security treatment of ECVRF and batch verifications
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- The unique chain rule and its applications
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Post-quantum verifiable random function from symmetric primitives in PoS blockchain
- Tweakable $$\mathcal {S}_{\text{ leeve }}$$: A Novel $$\mathcal {S}_{\text{ leeve }}$$ Construction Based on Tweakable Hash Functions
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Permissionless consensus in the resource model
- Three attacks on proof-of-stake ethereum
- Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- FAST: fair auctions via secret transactions
- Minting mechanism for proof of stake blockchains
- Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Instant block confirmation in the sleepy model
- Fine-grained forward secrecy: allow-list/deny-list encryption and applications
- PoSAT: proof-of-work availability and unpredictability, without the work
- Practical post-quantum few-time verifiable random function with applications to Algorand
- SoK: communication across distributed ledgers
- Maravedí: a secure and practical protocol to trade risk for instantaneous finality
- Practical settlement bounds for longest-chain consensus
- Proof-of-reputation blockchain with Nakamoto fallback
- Divide \& Scale: formalization and roadmap to robust sharding
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- PAPR: publicly auditable privacy revocation for anonymous credentials
- Proofs about Network Communication: For Humans and Machines
- Classical and quantum security of elliptic curve VRF, via relative indifferentiability
- Practical provably secure flooding for blockchains
- Abuse resistant law enforcement access systems
- Dynamic ad hoc clock synchronization
- TARDIS: a foundation of time-lock puzzles in UC
- Mining for privacy: how to bootstrap a snarky blockchain
- Verifiable random functions with optimal tightness
- The availability-accountability dilemma and its resolution via accountability gadgets
- Algorand: a secure and efficient distributed ledger
- Communication complexity of Byzantine agreement, revisited
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
- On elapsed time consensus protocols
- Practical verifiable random function with RKA security
- Non-malleable time-lock puzzles and applications
- Simulatable verifiable random function from the LWE assumption
- Security of the blockchain against long delay attack
- WOTSwana: a generalized \(\mathcal{S}_{\mathrm{ leeve }}\) construction for multiple proofs of ownership
This page was built for publication: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648822)
