FruitChains
From MaRDI portal
Publication:5368979
DOI10.1145/3087801.3087809zbMath1380.68059OpenAlexW2738891482MaRDI QIDQ5368979
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
Related Items (24)
Game-theoretic fairness meets multi-party protocols: the case of leader election ⋮ Fluid MPC: secure multiparty computation with dynamic participants ⋮ A rational protocol treatment of 51\% attacks ⋮ Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions ⋮ PoSAT: proof-of-work availability and unpredictability, without the work ⋮ On the bit security of cryptographic primitives ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Towards overcoming the undercutting problem ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Algorand: a secure and efficient distributed ledger ⋮ Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Practical provably secure flooding for blockchains ⋮ Better incentives for proof-of-work ⋮ On elapsed time consensus protocols ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Decentralizing information technology: the advent of resource based systems ⋮ Permissionless clock synchronization with public setup ⋮ Security of the blockchain against long delay attack ⋮ Decentralized Incentive-Compatible and Sybil-Proof Transaction Advertisement ⋮ Minting mechanism for proof of stake blockchains ⋮ Incentive compatible and anti-compounding of wealth in proof-of-stake ⋮ Order-fairness for Byzantine consensus ⋮ Analysis of the Blockchain Protocol in Asynchronous Networks
This page was built for publication: FruitChains
