Lockable obfuscation from circularly insecure fully homomorphic encryption
From MaRDI portal
Publication:6169028
DOI10.1007/978-3-030-97131-1_3zbMATH Open1519.94146OpenAlexW3204248498MaRDI QIDQ6169028FDOQ6169028
Authors: Kamil Kluczniak 
Publication date: 10 August 2023
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97131-1_3
Recommendations
- Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) 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
- Title not available (Why is that?)
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
- Efficient public-key cryptography in the presence of key leakage
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- A Pseudorandom Generator from any One-way Function
- Public-key encryption schemes with auxiliary inputs
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- A Leakage-Resilient Mode of Operation
- On cryptography with auxiliary input
- Public-Key Cryptosystems Resilient to Key Leakage
- Public-key encryption in the bounded-retrieval model
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- On the (Im)Possibility of Key Dependent Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Title not available (Why is that?)
- Correcting errors without leaking partial information
- On symmetric encryption and point obfuscation
- Obfuscation of hyperplane membership
- On obfuscating point functions
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- On the (im)possibility of obfuscating programs
- Obfuscating Point Functions with Multibit Output
- Title not available (Why is that?)
- On the circular security of bit-encryption
- Another step towards realizing random oracles: non-malleable point obfuscation
- Point-function obfuscation: a framework and generic constructions
- Cryptographic agility and its relation to circular encryption
- A simple obfuscation scheme for pattern-matching with wildcards
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- On perfect correctness in (lockable) obfuscation
- New techniques for obfuscating conjunctions
- Obfuscating conjunctions under entropic ring LWE
- Obfuscating conjunctions
- Graph-induced multilinear maps from lattices
- Upgrading to functional encryption
- Traitor-tracing from LWE made simple and attribute-based
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation with non-trivial efficiency
- Learning with rounding, revisited. New reduction, properties and applications
- Collusion resistant traitor tracing from learning with errors
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- The Magic of ELFs
- 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
- Separations in circular security for arbitrary length key cycles
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Candidate obfuscation via oblivious LWE sampling
- Sum-of-squares meets program obfuscation, revisited
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Post-quantum zero knowledge in constant rounds
- Weak zero-knowledge beyond the black-box barrier
- New definitions and separations for circular security
- Secure quantum extraction protocols
- Obfuscating simple functionalities from knowledge assumptions
- New circular security counterexamples from decision linear and learning with errors
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Lockable obfuscation from circularly insecure fully homomorphic encryption
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)
