On the Connection between Leakage Tolerance and Adaptive Security
From MaRDI portal
Publication:4916027
DOI10.1007/978-3-642-36362-7_30zbMath1314.94091MaRDI QIDQ4916027
Jesper Buus Nielsen, Daniele Venturi, Angela Zottarel
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_30
94A60: Cryptography
Related Items
Predictable Arguments of Knowledge, Fully Leakage-Resilient Codes, Constructing tree decompositions of graphs with bounded gonality, Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model, Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation, Impossibility of Black-Box Simulation Against Leakage Attacks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel repetition of computationally sound protocols revisited
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Leakage-Resilient Circuits without Computational Assumptions
- Leakage-Tolerant Interactive Protocols
- Quantum Proofs of Knowledge
- Parallel Repetition for Leakage Resilience Amplification Revisited
- After-the-Fact Leakage in Public-Key Encryption
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Leakage-Resilient Cryptography from the Inner-Product Extractor
- Leakage-Resilient Signatures
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Leakage-Resilient Storage
- A Leakage-Resilient Mode of Operation
- Universal Arguments and their Applications
- Signature Schemes with Bounded Leakage Resilience
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Computationally Sound Proofs
- On cryptography with auxiliary input
- Leakage-Resilient Zero Knowledge
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- On Seed-Incompressible Functions
- Storing Secrets on Continually Leaky Devices
- Automata, Languages and Programming
- Public-Key Cryptosystems Resilient to Key Leakage
- Theory of Cryptography
