Black-box obfuscation for d-CNFs

DOI10.1145/2554797.2554820MaRDI QIDQ2988884zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

cryptographyprogram obfuscation

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Obfuscating conjunctions
• Obfuscating conjunctions
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• Obfuscation for Cryptographic Purposes
• How to obfuscate programs directly

Cites work

• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Bounds for Width Two Branching Programs
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Evaluating Branching Programs on Encrypted Data
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• New lattice-based cryptographic constructions
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public-key cryptosystems from the worst-case shortest vector problem
• Toward basing fully homomorphic encryption on worst-case hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(12)

• Obfuscating conjunctions under entropic ring LWE
• Obfuscating conjunctions
• Efficient obfuscation for CNF circuits and applications in cloud computing
• Obfuscating circuits via composite-order graded encoding
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• Indistinguishability obfuscation: from approximate to exact
• New techniques for obfuscating conjunctions
• Secret-sharing for NP
• Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
• Obfuscating conjunctions
• Shorter circuit obfuscation in challenging security models

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)