High entropy random selection protocols
From MaRDI portal
Publication:2659776
DOI10.1007/s00453-020-00770-yOpenAlexW3091205003MaRDI QIDQ2659776
Matthias Christandl, Michal Koucký, Harry Buhrman, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin
Publication date: 26 March 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/30057
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Restriction and Kakeya phenomena for finite fields
- Simple and efficient leader election in the full information model
- Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver
- On the size of Kakeya sets in finite fields
- Kakeya Sets, New Mergers, and Old Extractors
- Shannon Entropy vs. Kolmogorov Complexity
- The round complexity of two-party random selection
- High Entropy Random Selection Protocols
- A Robust Noncryptographic Protocol for Collective Coin Flipping
- Coin flipping by telephone a protocol for solving impossible problems
- Coin-Flipping Games Immune against Linear-Sized Coalitions
- Fault-tolerant Computation in the Full Information Model
- Random Selection in Few Rounds
- Random Selection with an Adversarial Majority
- Theory of Cryptography
This page was built for publication: High entropy random selection protocols