Fully leakage-resilient signatures
From MaRDI portal
Publication:2392093
DOI10.1007/S00145-012-9136-3zbMATH Open1335.94089OpenAlexW2053318192MaRDI QIDQ2392093FDOQ2392093
Authors: 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
Recommendations
Cites Work
- Probabilistic encryption
- Theory of Cryptography
- Efficient public-key cryptography in the presence of key leakage
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Bonsai trees, or how to delegate a lattice basis
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Identity-Based Encryption Without Random Oracles
- Title not available (Why is that?)
- Universal Arguments and their Applications
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Framework for Efficient and Composable Oblivious Transfer
- Signatures resilient to continual leakage on memory and computation
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Leakage-resilient signatures
- Public-key encryption schemes with auxiliary inputs
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- A Leakage-Resilient Mode of Operation
- Signature schemes with bounded leakage resilience
- On cryptography with auxiliary input
- Advances in Cryptology – CRYPTO 2004
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Public-Key Cryptosystems Resilient to Key Leakage
- Theory of Cryptography
- Short and Stateless Signatures from the RSA Assumption
- Public-key encryption in the bounded-retrieval model
- 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
- Leakage-resilient zero knowledge
- How to leak on key updates
- Advances in Cryptology - CRYPTO 2003
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Storing Secrets on Continually Leaky Devices
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Perfect Non-interactive Zero Knowledge for NP
- Computationally Sound Proofs
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- More constructions of lossy and correlation-secure trapdoor functions
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- Cryptography with tamperable and leaky memory
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Lossy Trapdoor Functions and Their Applications
- Protecting cryptographic keys against continual leakage
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Reconstructing RSA Private Keys from Random Key Bits
Cited In (37)
- Hierarchical attribute based encryption with continuous leakage-resilience
- A black-box construction of strongly unforgeable signature scheme in the leakage setting
- Leakage-resilient group signature: definitions and constructions
- Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Leakage Resiliency
- Forward-security under continual leakage
- Signatures Resilient to Uninvertible Leakage
- On continual leakage of discrete log representations
- Efficiently testable circuits without conductivity
- Strong authenticated key exchange with auxiliary inputs
- Signature schemes secure against hard-to-invert leakage
- Efficient public-key cryptography with bounded leakage and tamper resilience
- Leakage-Resilient Signatures with Graceful Degradation
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Towards a ring analogue of the leftover hash lemma
- New bounds on the local leakage resilience of Shamir's secret sharing scheme
- A leakage-resilient pairing-based variant of the Schnorr signature scheme
- Leakage resilient one-way functions: the auxiliary-input setting
- Signature schemes with bounded leakage resilience
- Predictable arguments of knowledge
- Leakage-resilient signatures
- Signatures resilient to continual leakage on memory and computation
- Mind your coins: fully leakage-resilient signatures with graceful degradation
- Impossibility of black-box simulation against leakage attacks
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Efficient fully-leakage resilient one-more signature schemes
- Black-box constructions of signature schemes in the bounded leakage setting
- (In)security of ring-LWE under partial key exposure
- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
- Fully Leakage-Resilient Codes
- Naor-Yung paradigm with shared randomness and applications
- Naor-Yung Paradigm with Shared Randomness and Applications
- Fully leakage-resilient signatures with auxiliary inputs
- Fully Leakage-Resilient Signatures
- A practical leakage-resilient signature scheme in the generic group model
- A black-box construction of strongly unforgeable signature schemes in the bounded leakage model
- Leakage-resilient ring signature schemes
- Strongly Unforgeable Signature Resilient to Polynomially Hard-to-Invert Leakage Under Standard Assumptions
This page was built for publication: Fully leakage-resilient signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392093)
