Lockable obfuscation from circularly insecure fully homomorphic encryption
From MaRDI portal
(Redirected from Publication:6169028)
Recommendations
- Obfuscation (IND-CPA security circular security)
- On perfect correctness in (lockable) obfuscation
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Candidate indistinguishability obfuscation and functional encryption for all circuits
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1852136 (Why is no real title available?)
- A Leakage-Resilient Mode of Operation
- A Pseudorandom Generator from any One-way Function
- A simple obfuscation scheme for pattern-matching with wildcards
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Another step towards realizing random oracles: non-malleable point obfuscation
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Collusion resistant traitor tracing from learning with errors
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Correcting errors without leaking partial information
- Cryptographic agility and its relation to circular encryption
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Efficient public-key cryptography in the presence of key leakage
- Fully homomorphic encryption using ideal lattices
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Learning with rounding, revisited. New reduction, properties and applications
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- New circular security counterexamples from decision linear and learning with errors
- New definitions and separations for circular security
- New techniques for obfuscating conjunctions
- Obfuscating Point Functions with Multibit Output
- Obfuscating conjunctions
- Obfuscating conjunctions under entropic ring LWE
- Obfuscating simple functionalities from knowledge assumptions
- Obfuscation of hyperplane membership
- On cryptography with auxiliary input
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On obfuscating point functions
- On perfect correctness in (lockable) obfuscation
- On symmetric encryption and point obfuscation
- On the (Im)Possibility of Key Dependent Encryption
- On the (im)possibility of obfuscating programs
- On the circular security of bit-encryption
- Point-function obfuscation: a framework and generic constructions
- Post-quantum zero knowledge in constant rounds
- Public-Key Cryptosystems Resilient to Key Leakage
- Public-key encryption in the bounded-retrieval model
- Public-key encryption schemes with auxiliary inputs
- Secure quantum extraction protocols
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- 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
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Sum-of-squares meets program obfuscation, revisited
- The Magic of ELFs
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Traitor-tracing from LWE made simple and attribute-based
- Upgrading to functional encryption
- Weak zero-knowledge beyond the black-box barrier
Cited in
(3)
This page was built for publication: Lockable obfuscation from circularly insecure fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169028)
