Deterministic Public-Key Encryption Under Continual Leakage
From MaRDI portal
Publication:2822678
DOI10.1007/978-3-319-39555-5_17zbMath1348.94063OpenAlexW2499140796MaRDI QIDQ2822678
Yannis Rouselakis, Venkata Koppula, Brent Waters, Omkant Pandey
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_17
Related Items (4)
Updatable all-but-one dual projective hashing and its applications ⋮ Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage ⋮ A generic construction of CCA-secure deterministic encryption ⋮ Point-Function Obfuscation: A Framework and Generic Constructions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Interactive Proofs under Continual Memory Leakage
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- All-But-Many Lossy Trapdoor Functions
- Identity-Based (Lossy) Trapdoor Functions and Applications
- Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
- Incremental Deterministic Public-Key Encryption
- Achieving Leakage Resilience through Dual System Encryption
- Fully Leakage-Resilient Signatures
- A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Lossy trapdoor functions and their applications
- 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
- Correcting errors without leaking partial information
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Deterministic and Efficiently Searchable Encryption
- Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
- Leakage-Resilient Cryptography from Minimal Assumptions
- On cryptography with auxiliary input
- Leakage-Resilient Zero Knowledge
- Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
- Advances in Cryptology – CRYPTO 2004
- Multiparty computation secure against continual memory leakage
- How to leak on key updates
- Advances in Cryptology - CRYPTO 2003
- Achieving Constant Round Leakage-Resilient Zero-Knowledge
- Public-Key Cryptosystems Resilient to Key Leakage
- Topics in Cryptology – CT-RSA 2006
- Theory of Cryptography
This page was built for publication: Deterministic Public-Key Encryption Under Continual Leakage
