Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
From MaRDI portal
Publication:729893
DOI10.1016/J.TCS.2016.11.016zbMath1380.94087OpenAlexW2308395123MaRDI QIDQ729893
Daniele Venturi, Jesper Buus Nielsen, Antonio Faonio
Publication date: 22 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.016
Cites Work
- Hybrid commitments and their applications to zero-knowledge proof systems
- Security arguments for digital signatures and blind signatures
- Fully leakage-resilient signatures
- Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions
- Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier
- On the Non-malleability of the Fiat-Shamir Transform
- Simulatable Leakage: Analysis, Pitfalls, and New Constructions
- Signatures Resilient to Continual Leakage on Memory and Computation
- After-the-Fact Leakage in Public-Key Encryption
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Leakage-Resilient Signatures
- Public-Key Encryption Schemes with Auxiliary Inputs
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Impossibility of Black-Box Simulation Against Leakage Attacks
- How to Protect Yourself without Perfect Shredding
- Public-Key Encryption in the Bounded-Retrieval Model
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Leakage-Resilient Storage
- Perfect Non-interactive Zero Knowledge for NP
- Programmable Hash Functions and Their Applications
- Compact Proofs of Retrievability
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
- Proofs of Storage from Homomorphic Identification Protocols
- Signature Schemes with Bounded Leakage Resilience
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the (In)security of Fischlin’s Paradigm
- Signature Schemes Secure against Hard-to-Invert Leakage
- On the Connection between Leakage Tolerance and Adaptive Security
- A Second Look at Fischlin’s Transformation
- On cryptography with auxiliary input
- Leakage-Resilient Zero Knowledge
- Cryptography with Tamperable and Leaky Memory
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Leakage-Resilient Signatures with Graceful Degradation
- Multiparty computation secure against continual memory leakage
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
- Advances in Cryptology - CRYPTO 2003
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Storing Secrets on Continually Leaky Devices
- Theory of Cryptography
- Automata, Languages and Programming
- Achieving Constant Round Leakage-Resilient Zero-Knowledge
- Non-interactive Zaps and New Techniques for NIZK
- On Forward-Secure Storage
- Public-Key Cryptosystems Resilient to Key Leakage
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
