How to use bitcoin to design fair protocols
From MaRDI portal
Recommendations
Cited in
(50)- Incentive-driven attacker for corrupting two-party protocols
- Game theoretic notions of fairness in multi-party coin toss
- Fast lottery-based micropayments for decentralized currencies
- What security can we achieve within 4 rounds?
- Blockchain-based two-party fair contract signing scheme
- Fair hierarchical secret sharing scheme based on smart contract
- TARDIS: a foundation of time-lock puzzles in UC
- Abuse resistant law enforcement access systems
- Publicly verifiable zero knowledge from (collapsing) blockchains
- FAST: fair auctions via secret transactions
- Blind polynomial evaluation and data trading
- Coin-based multi-party fair exchange
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- A blockchain-based creditable and distributed incentive mechanism for participant mobile crowdsensing in edge computing
- Shielded computations in smart contracts overcoming forks
- A formal model of Algorand smart contracts
- SoK: communication across distributed ledgers
- FPPW: a fair and privacy preserving watchtower for bitcoin
- Formal verification of fair exchange based on Bitcoin smart contracts
- A complete characterization of game-theoretically fair, multi-party coin toss
- The impact of network delay on Nakamoto consensus mechanism
- Rational sumchecks
- What Security Can We Achieve Within 4 Rounds?
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Verifying liquidity of recursive bitcoin contracts
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Modeling Bitcoin contracts by timed automata
- Fair and robust multi-party computation using a global transaction ledger
- Escrow protocols for cryptocurrencies: how to buy physical goods using Bitcoin
- Constant-round linear-broadcast secure computation with penalties
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- \(\log^\ast\)-round game-theoretically-fair leader election
- Fully-secure MPC with minimal trust
- Generalized channels from limited blockchain scripts and adaptor signatures
- Financially backed covert security
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Bitcoin as a Transaction Ledger: A Composable Treatment
- Constant-deposit multiparty lotteries on Bitcoin for arbitrary number of players and winners
- Eagle: efficient privacy preserving smart contracts
- Synchronizable fair exchange
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- How to construct public timeline for RSA-formed time-lock cryptography
- Secure computation with penalties, revisited: how to handle coins with various colors
- Jackpot: non-interactive aggregatable lotteries
- The bitcoin backbone protocol: analysis and applications
- A novel lottery protocol based on quantum blockchain
- Game-theoretically fair coin toss with arbitrary preferences
- A denial of service attack against fair computations using bitcoin deposits
This page was built for publication: How to use bitcoin to design fair protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874551)
