Leakage-resilient coin tossing
From MaRDI portal
Publication:2251154
DOI10.1007/s00446-013-0206-zzbMath1291.68427OpenAlexW1973454358MaRDI QIDQ2251154
Shafi Goldwasser, Elette Boyle, Yael Tauman Kalai
Publication date: 11 July 2014
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-013-0206-z
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)
Related Items (5)
Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ Fully Leakage-Resilient Codes ⋮ Lower bounds for leakage-resilient secret sharing ⋮ Leakage-Resilient Coin Tossing
Cites Work
- Unnamed Item
- Unnamed Item
- Secure Computation against Adaptive Auxiliary Information
- Leakage-Tolerant Interactive Protocols
- Distributed public key schemes secure against continual leakage
- How to share a secret
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Flipping Persuasively in Constant Time
- Extractors with weak random seeds
- An Optimally Fair Coin Toss
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Signature Schemes with Bounded Leakage Resilience
- All-or-nothing encryption and the package transform
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
- Leakage-Resilient Zero Knowledge
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Distributed Computing
- Multiparty computation secure against continual memory leakage
- Advances in Cryptology - CRYPTO 2003
- Deterministic extractors for small-space sources
- Public-Key Cryptosystems Resilient to Key Leakage
- Theory of Cryptography
This page was built for publication: Leakage-resilient coin tossing
