Obfuscating Circuits via Composite-Order Graded Encoding

DOI10.1007/978-3-662-46497-7_21zbMATH Open1382.94049OpenAlexW2169673773MaRDI QIDQ5261690FDOQ5261690

Zvika Brakerski, Benny Applebaum

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_21

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (31)

• Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
• Constraining Pseudorandom Functions Privately
• On Removing Graded Encodings from Functional Encryption
• Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
• Indistinguishability Obfuscation: From Approximate to Exact
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Cutting-edge cryptography through the lens of secret sharing
• Multilinear maps from obfuscation
• Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
• On the complexity of compressing obfuscation
• Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
• Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
• Multilinear Maps from Obfuscation
• Perfect Structure on the Edge of Chaos
• Cutting-Edge Cryptography Through the Lens of Secret Sharing
• How to Avoid Obfuscation Using Witness PRFs
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• On the Correlation Intractability of Obfuscated Pseudorandom Functions
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
• Compactness vs Collusion Resistance in Functional Encryption
• Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
• On virtual grey box obfuscation for general circuits
• Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
• Constrained pseudorandom functions from functional encryption
• Practical Order-Revealing Encryption with Limited Leakage
• Shorter Circuit Obfuscation in Challenging Security Models
• Obfuscating conjunctions
• Cryptanalyses of Candidate Branching Program Obfuscators
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
• Universal Samplers with Fast Verification
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

This page was built for publication: Obfuscating Circuits via Composite-Order Graded Encoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261690)