Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
From MaRDI portal
Recommendations
- Separations in circular security for arbitrary length key cycles
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Indistinguishability obfuscation from circular security
- On the circular security of bit-encryption
- IND-CCA secure cryptography based on a variant of the LPN problem
- Reproducible circularly secure bit encryption: applications and realizations
- Circular-Secure Encryption from Decision Diffie-Hellman
- Reproducible circularly-secure bit encryption: applications and realizations
- On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
Cites work
- Black-box circular-secure encryption beyond affine functions
- Bounded key-dependent message security
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Circular and KDM security for identity-based encryption
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Circular-Secure Encryption from Decision Diffie-Hellman
- Cryptographic agility and its relation to circular encryption
- Efficient circuit-size independent public key encryption with KDM security
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to obfuscate programs directly
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- Key-dependent message security: generic amplification and completeness
- New circular security counterexamples from decision linear and learning with errors
- New definitions and separations for circular security
- Obfuscation (IND-CPA security circular security)
- Obfuscation of probabilistic circuits and applications
- On lattices, learning with errors, random linear codes, and cryptography
- On the (Im)Possibility of Key Dependent Encryption
- Practical multilinear maps over the integers
- Probabilistic encryption
- Separations in circular security for arbitrary length key cycles
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
Cited in
(12)- Counterexamples to new circular security assumptions underlying iO
- Circular Security Separations for Arbitrary Length Cycles from LWE
- New definitions and separations for circular security
- Obfuscation (IND-CPA security circular security)
- Separations in circular security for arbitrary length key cycles
- Toward fine-grained blackbox separations between semantic and circular-security notions
- PFLM: privacy-preserving federated learning with membership proof
- Universal amplification of KDM security: from 1-key circular to multi-key KDM
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Fully composable homomorphic encryption
- Circular insecure encryption: from long cycles to short cycles
This page was built for publication: Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738789)
