Pages that link to "Item:Q3000555"
From MaRDI portal
The following pages link to On the Black-Box Complexity of Optimally-Fair Coin Tossing (Q3000555):
Displaying 23 items.
- Limits on the usefulness of random oracles (Q290382) (← links)
- An optimally fair coin toss (Q315542) (← links)
- A lower bound for adaptively-secure collective coin flipping protocols (Q822636) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Polynomial-time targeted attacks on coin tossing for any number of corruptions (Q2697882) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling (Q5096104) (← links)
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols (Q5138779) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- On the complexity of fair coin flipping (Q5915598) (← links)
- On the complexity of fair coin flipping (Q5918656) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions (Q6562579) (← links)
- Communication lower bounds of key-agreement protocols via density increment arguments (Q6582217) (← links)
- Game-theoretically fair distributed sampling (Q6653028) (← links)
