Black-box obfuscation for d-CNFs
From MaRDI portal
Publication:2988884
DOI10.1145/2554797.2554820zbMath1364.94527OpenAlexW2037117602MaRDI QIDQ2988884
Zvika Brakerski, Guy N. Rothblum
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2554797.2554820
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation ⋮ Secret-sharing for NP ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Obfuscating conjunctions ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Obfuscating circuits via composite-order graded encoding ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Shorter Circuit Obfuscation in Challenging Security Models
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
