FruitChains: a fair blockchain

DOI10.1145/3087801.3087809MaRDI QIDQ5368979zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fairnessNash equilibriumdistributed consensusblockchains

Mathematics Subject Classification ID

Applications of game theory (91A80) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Analysis of the Blockchain Protocol in Asynchronous Networks
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Weight-based Nakamoto-style blockchains
• On reward sharing in blockchain mining pools
• Majority is not enough: bitcoin mining is vulnerable

Cited in

(38)

• Wendy grows up: more order fairness
• On the bit security of cryptographic primitives
• Soft power: upgrading chain macroeconomic policy through soft forks
• Quick order fairness
• Towards overcoming the undercutting problem
• Decentralizing information technology: the advent of resource based systems
• Minting mechanism for proof of stake blockchains
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Bitcoin as a Transaction Ledger: A Composable Treatment
• Universal composable transaction serialization with order fairness
• Building blocks of sharding blockchain systems: concepts, approaches, and open problems
• Proof-of-reputation blockchain with Nakamoto fallback
• Incentive compatible and anti-compounding of wealth in proof-of-stake
• Order-fairness for Byzantine consensus
• Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
• Player-replaceability and forensic support are two sides of the same (crypto) coin
• On reward sharing in blockchain mining pools
• Algorand: a secure and efficient distributed ledger
• Decentralized incentive-compatible and Sybil-proof transaction advertisement
• Better incentives for proof-of-work
• \(\log^\ast\)-round game-theoretically-fair leader election
• Analysis of the Blockchain Protocol in Asynchronous Networks
• 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
• Security of the blockchain against long delay attack
• 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
• Permissionless clock synchronization with public setup
• Practical provably secure flooding for blockchains
• On elapsed time consensus protocols
• Weight-based Nakamoto-style blockchains
• PoSAT: proof-of-work availability and unpredictability, without the work
• A complete characterization of game-theoretically fair, multi-party coin toss
• Transparent batchable time-lock puzzles and applications to Byzantine consensus
• Fast-to-finalize Nakamoto-like consensus

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)