Leakage-Resilient Coin Tossing

DOI10.1007/978-3-642-24100-0_16zbMath1350.68042OpenAlexW1888689086MaRDI QIDQ3095326

Yael Tauman Kalai, Elette Boyle

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/71675

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Related Items (6)

Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ Must the communication graph of MPC protocols be an expander? ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ From fairness to full security in multiparty computation

Cites Work

• Unnamed Item
• Leakage-resilient coin tossing
• Distributed public key schemes secure against continual leakage
• How to share a secret
• Program Obfuscation with Leaky Hardware
• Flipping Persuasively in Constant Time
• An Optimally Fair Coin Toss
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
• Leakage-Resilient Zero Knowledge
• Distributed Computing
• 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