Incompressible encryption beyond CPA/CCA security
From MaRDI portal
Cites work
- A Closer Look at Anonymity and Robustness in Encryption Schemes
- A framework for achieving KDM-CCA secure public-key encryption
- Advances in Cryptology - EUROCRYPT 2004
- Anonymous public key encryption under corruptions
- Anonymous, robust post-quantum public key encryption
- Bounded key-dependent message security
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- CCA security and trapdoor functions via key-dependent-message security
- Circular security is complete for KDM security
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Circular-Secure Encryption from Decision Diffie-Hellman
- Completeness of single-bit projection-KDM security for public key encryption
- CPA-to-CCA transformation for KDM security
- Cryptographic agility and its relation to circular encryption
- Cryptographic primitives with hinting property
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 2081087 (Why is no real title available?)
- Incompressible cryptography
- Incompressible encodings
- Incompressible functional encryption
- Indistinguishability obfuscation from well-founded assumptions
- Instance compression, revisited
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- KDM-security via homomorphic smooth projective hashing
- Leakage-resilient incompressible cryptography: constructions and barriers
- Leakage-resilient key-dependent message secure encryption schemes
- Multi-instance randomness extraction and security against bounded-storage mass surveillance
- New circular security counterexamples from decision linear and learning with errors
- New definitions and separations for circular security
- Non-committing identity based encryption: constructions and applications
- Obfuscation (IND-CPA security circular security)
- On Forward-Secure Storage
- On the (Im)Possibility of Key Dependent Encryption
- Privately constraining and programming PRFs, the LWE way
- Rate-1 incompressible encryption from standard assumptions
- Robust Encryption
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Separations in circular security for arbitrary length key cycles
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Unconditionally Secure Anonymous Encryption and Group Authentication
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
This page was built for publication: Incompressible encryption beyond CPA/CCA security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346668)
