Analysis of the Blockchain Protocol in Asynchronous Networks
From MaRDI portal
Publication:5267421
DOI10.1007/978-3-319-56614-6_22zbMATH Open1415.94455OpenAlexW2613387059MaRDI QIDQ5267421FDOQ5267421
Authors: Rafael Pass, Lior Seeman, Abhi Shelat 
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_22
Recommendations
- Algorithmic analysis of blockchain efficiency with communication delay
- A theory of transaction parallelism in blockchains
- A knowledge-based analysis of the blockchain protocol
- Modeling and analysis of block arrival times in the Bitcoin blockchain
- The Bitcoin Backbone Protocol: Analysis and Applications
- Blockchain in dynamic networks
- Asynchronous byzantine agreement protocols
- Distributed sequential consensus in networks: analysis of partially connected blockchains with uncertainty
- Transaction-confirmation time for bitcoin: a queueing analytical approach to blockchain mechanism
Cites Work
- Title not available (Why is that?)
- Reaching Agreement in the Presence of Faults
- Title not available (Why is that?)
- Secure Computation Without Authentication
- Analysis of the evolution of peer-to-peer systems
- Majority is not enough: bitcoin mining is vulnerable
- Title not available (Why is that?)
- The Bitcoin Backbone Protocol: Analysis and Applications
- Efficient algorithms for anonymous Byzantine agreement
- How to use bitcoin to design fair protocols
- Chernoff-Hoeffding bounds for Markov chains: generalized and simplified
- Secure high-rate transaction processing in bitcoin
- FruitChains: a fair blockchain
- Byzantizing Paxos by refinement
Cited In (72)
- Modeling and analysis of block arrival times in the Bitcoin blockchain
- Afgjort: a partially synchronous finality layer for blockchains
- Dirac-based reduction techniques for quantitative analysis of discrete-time Markov models
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Achieving almost all blockchain functionalities with polylogarithmic storage
- Permissionless consensus in the resource model
- Short paper: On the claims of weak block synchronization in Bitcoin
- Game theoretic notions of fairness in multi-party coin toss
- How to build time-lock encryption
- 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
- The sleepy model of consensus
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup
- Decentralizing information technology: the advent of resource based systems
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- The Bitcoin backbone protocol with chains of variable difficulty
- FruitChains: a fair blockchain
- Minting mechanism for proof of stake blockchains
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Monotonic Prefix Consistency in Distributed Systems
- Shielded computations in smart contracts overcoming forks
- Weight-based Nakamoto-style blockchains
- Blockchain CAP theorem allows user-dependent adaptivity and finality
- Instant block confirmation in the sleepy model
- Fraud and data availability proofs: detecting invalid blocks in light clients
- PoSAT: proof-of-work availability and unpredictability, without the work
- Short Paper: Secure Offline Payments in Bitcoin
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- The Bitcoin Backbone Protocol: Analysis and Applications
- Proof-of-reputation blockchain with Nakamoto fallback
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- On the bit security of cryptographic primitives
- A knowledge-based analysis of the blockchain protocol
- Practical provably secure flooding for blockchains
- Pay to win: cheap, cross-chain bribing attacks on PoW cryptocurrencies
- Risk framework for bitcoin custody operation with the revault protocol
- SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies
- Correctness of Tendermint-Core Blockchains
- Fair hierarchical secret sharing scheme based on smart contract
- How to extract useful randomness from unreliable sources
- Dynamic ad hoc clock synchronization
- Mining for privacy: how to bootstrap a snarky blockchain
- Algorand: a secure and efficient distributed ledger
- Hybrid consensus: efficient consensus in the permissionless model
- Fast-to-finalize Nakamoto-like consensus
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol
- Brief announcement: Game theoretical framework for analyzing blockchains robustness
- Publicly verifiable zero knowledge from (collapsing) blockchains
- Etherless Ethereum Tokens: simulating native tokens in Ethereum
- The impact of network delay on Nakamoto consensus mechanism
- Security of the blockchain against long delay attack
- Blockchain in dynamic networks
- Byzantine generals in the permissionless setting
- Fair delivery of decentralised randomness beacon
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Permissionless clock synchronization with public setup
- Completeness theorems for adaptively secure broadcast
- Practical settlement bounds for longest-chain consensus
- Divide \& Scale: formalization and roadmap to robust sharding
- Data flow dissemination in a network
- 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
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Round efficient Byzantine agreement from VDFs
- Compact identity-based signature and puncturable signature from SQISign
Uses Software
This page was built for publication: Analysis of the Blockchain Protocol in Asynchronous Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267421)
