Black-box obfuscation for d-CNFs
DOI10.1145/2554797.2554820zbMATH Open1364.94527OpenAlexW2037117602WikidataQ130966467 ScholiaQ130966467MaRDI QIDQ2988884FDOQ2988884
Authors: 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
Recommendations
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- On lattices, learning with errors, random linear codes, and cryptography
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- New lattice-based cryptographic constructions
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Toward basing fully homomorphic encryption on worst-case hardness
Cited In (11)
- Obfuscating conjunctions
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
- Obfuscating circuits via composite-order graded encoding
- Secret-sharing for NP
- Obfuscating conjunctions under entropic ring LWE
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Shorter circuit obfuscation in challenging security models
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Indistinguishability obfuscation: from approximate to exact
- Obfuscating conjunctions
This page was built for publication: Black-box obfuscation for \(d\)-CNFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988884)
