Lockable obfuscation from circularly insecure fully homomorphic encryption
From MaRDI portal
Publication:6169028
DOI10.1007/978-3-030-97131-1_3zbMath1519.94146OpenAlexW3204248498MaRDI QIDQ6169028
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple obfuscation scheme for pattern-matching with wildcards
- Upgrading to functional encryption
- Traitor-tracing from LWE made simple and attribute-based
- Another step towards realizing random oracles: non-malleable point obfuscation
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Candidate iO from homomorphic encryption schemes
- On perfect correctness in (lockable) obfuscation
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Candidate obfuscation via oblivious LWE sampling
- Secure quantum extraction protocols
- Obfuscating simple functionalities from knowledge assumptions
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Sum-of-squares meets program obfuscation, revisited
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- New techniques for obfuscating conjunctions
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- New Circular Security Counterexamples from Decision Linear and Learning with Errors
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Point-Function Obfuscation: A Framework and Generic Constructions
- Obfuscating Conjunctions under Entropic Ring LWE
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
- The Magic of ELFs
- Learning with Rounding, Revisited
- Obfuscating Conjunctions
- New Definitions and Separations for Circular Security
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- On Symmetric Encryption and Point Obfuscation
- Obfuscation of Hyperplane Membership
- Public-Key Encryption Schemes with Auxiliary Inputs
- On Ideal Lattices and Learning with Errors over Rings
- Public-Key Encryption in the Bounded-Retrieval Model
- Cryptographic Agility and Its Relation to Circular Encryption
- On obfuscating point functions
- Correcting errors without leaking partial information
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- On the (Im)Possibility of Key Dependent Encryption
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- A Leakage-Resilient Mode of Operation
- A Pseudorandom Generator from any One-way Function
- On the Circular Security of Bit-Encryption
- Post-quantum zero knowledge in constant rounds
- Fully homomorphic encryption using ideal lattices
- On cryptography with auxiliary input
- Weak zero-knowledge beyond the black-box barrier
- Collusion resistant traitor tracing from learning with errors
- Separations in Circular Security for Arbitrary Length Key Cycles
- Graph-Induced Multilinear Maps from Lattices
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- On the (im)possibility of obfuscating programs
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Obfuscating Point Functions with Multibit Output
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Public-Key Cryptosystems Resilient to Key Leakage
- On lattices, learning with errors, random linear codes, and cryptography
- Lockable obfuscation from circularly insecure fully homomorphic encryption
