Fully leakage-resilient signatures
From MaRDI portal
Publication:2392093
DOI10.1007/s00145-012-9136-3zbMath1335.94089OpenAlexW2053318192MaRDI QIDQ2392093
Elette Boyle, Gil Segev, Daniel Wichs
Publication date: 1 August 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-012-9136-3
Related Items (20)
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting ⋮ Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Strong authenticated key exchange with auxiliary inputs ⋮ A Black-Box Construction of Strongly Unforgeable Signature Schemes in the Bounded Leakage Model ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ New bounds on the local leakage resilience of Shamir's secret sharing scheme ⋮ A Black-Box Construction of Strongly Unforgeable Signature Scheme in the Leakage Setting ⋮ Leakage-resilient ring signature schemes ⋮ Hierarchical attribute based encryption with continuous leakage-resilience ⋮ Leakage-resilient group signature: definitions and constructions ⋮ Predictable Arguments of Knowledge ⋮ Fully Leakage-Resilient Codes ⋮ (In)security of ring-LWE under partial key exposure ⋮ Towards a ring analogue of the leftover hash lemma ⋮ Leakage resilient one-way functions: the auxiliary-input setting ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Black-box constructions of signature schemes in the bounded leakage setting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Signatures Resilient to Continual Leakage on Memory and Computation
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Reconstructing RSA Private Keys from Random Key Bits
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Short and Stateless Signatures from the RSA Assumption
- Lossy Trapdoor Functions and Their Applications
- Leakage-Resilient Signatures
- Public-Key Encryption Schemes with Auxiliary Inputs
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- Public-Key Encryption in the Bounded-Retrieval Model
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Bonsai Trees, or How to Delegate a Lattice Basis
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Protecting Cryptographic Keys against Continual Leakage
- Perfect Non-interactive Zero Knowledge for NP
- A Framework for Efficient and Composable Oblivious Transfer
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- 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
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Computationally Sound Proofs
- 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
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- How to leak on key updates
- Advances in Cryptology - CRYPTO 2003
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Storing Secrets on Continually Leaky Devices
- Theory of Cryptography
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- Public-Key Cryptosystems Resilient to Key Leakage
- Theory of Cryptography
This page was built for publication: Fully leakage-resilient signatures
