Pages that link to "Item:Q5267421"
From MaRDI portal
The following pages link to Analysis of the Blockchain Protocol in Asynchronous Networks (Q5267421):
Displaying 50 items.
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions (Q1633456) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain (Q1648822) (← links)
- The Bitcoin backbone protocol with chains of variable difficulty (Q1675729) (← links)
- Ouroboros: a provably secure proof-of-stake blockchain protocol (Q1675731) (← links)
- The sleepy model of consensus (Q1703930) (← links)
- Security of the blockchain against long delay attack (Q1710674) (← links)
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup (Q1753862) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Dirac-based reduction techniques for quantitative analysis of discrete-time Markov models (Q1997254) (← links)
- Fair hierarchical secret sharing scheme based on smart contract (Q2055532) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- Publicly verifiable zero knowledge from (collapsing) blockchains (Q2061968) (← links)
- Afgjort: a partially synchronous finality layer for blockchains (Q2106626) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- A rational protocol treatment of 51\% attacks (Q2128984) (← links)
- Shielded computations in smart contracts overcoming forks (Q2145367) (← links)
- Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← links)
- Weight-based Nakamoto-style blockchains (Q2146099) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Blockchain CAP theorem allows user-dependent adaptivity and finality (Q2147233) (← links)
- PoSAT: proof-of-work availability and unpredictability, without the work (Q2147235) (← links)
- Fraud and data availability proofs: detecting invalid blocks in light clients (Q2147248) (← links)
- Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- Risk framework for bitcoin custody operation with the revault protocol (Q2670809) (← links)
- SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies (Q2670873) (← links)
- Pay to win: cheap, cross-chain bribing attacks on PoW cryptocurrencies (Q2670874) (← links)
- Etherless Ethereum Tokens: simulating native tokens in Ethereum (Q2698288) (← links)
- The impact of network delay on Nakamoto consensus mechanism (Q2700298) (← links)
- The Bitcoin Backbone Protocol: Analysis and Applications (Q2948386) (← links)
- (Q3384077) (← links)
- Modeling and analysis of block arrival times in the Bitcoin blockchain (Q4988561) (← links)
- Correctness of Tendermint-Core Blockchains (Q5091090) (← links)
- Monotonic Prefix Consistency in Distributed Systems (Q5881533) (← links)
- Permissionless consensus in the resource model (Q6045237) (← links)
- Achieving almost all blockchain functionalities with polylogarithmic storage (Q6045249) (← links)
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
- Formalizing delayed adaptive corruptions and the security of flooding networks (Q6104341) (← links)
- Practical provably secure flooding for blockchains (Q6135421) (← links)
- SNACKs: leveraging proofs of sequential work for blockchain light clients (Q6135422) (← links)
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees (Q6135431) (← links)
- Blockchain in dynamic networks (Q6155240) (← links)
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions (Q6157530) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
