FruitChains: a fair blockchain
From MaRDI portal
Publication:5368979
DOI10.1145/3087801.3087809zbMATH Open1380.68059OpenAlexW2738891482MaRDI QIDQ5368979FDOQ5368979
Authors: Rafael Pass, Elaine Shi 
Publication date: 11 October 2017
Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3087801.3087809
Recommendations
Cited In (38)
- On reward sharing in blockchain mining pools
- Order-fairness for Byzantine consensus
- Better incentives for proof-of-work
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Quick order fairness
- Towards overcoming the undercutting problem
- Fluid MPC: secure multiparty computation with dynamic participants
- 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
- Decentralizing information technology: the advent of resource based systems
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Incentive compatible and anti-compounding of wealth in proof-of-stake
- Permissionless clock synchronization with public setup
- Minting mechanism for proof of stake blockchains
- Decentralized incentive-compatible and Sybil-proof transaction advertisement
- Weight-based Nakamoto-style blockchains
- PoSAT: proof-of-work availability and unpredictability, without the work
- Proof-of-reputation blockchain with Nakamoto fallback
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- On the bit security of cryptographic primitives
- Practical provably secure flooding for blockchains
- A complete characterization of game-theoretically fair, multi-party coin toss
- Wendy grows up: more order fairness
- Asymptotically optimal message dissemination with applications to blockchains
- Ordering transactions with bounded unfairness: definitions, complexity and constructions
- Proof-of-work-based consensus in expected-constant time
- Bitcoin as a Transaction Ledger: A Composable Treatment
- Universal composable transaction serialization with order fairness
- Algorand: a secure and efficient distributed ledger
- Fast-to-finalize Nakamoto-like consensus
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
- \(\log^\ast\)-round game-theoretically-fair leader election
- On elapsed time consensus protocols
- Security of the blockchain against long delay attack
- Soft power: upgrading chain macroeconomic policy through soft forks
- Analysis of the Blockchain Protocol in Asynchronous Networks
This page was built for publication: FruitChains: a fair blockchain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368979)
