Obfuscating Circuits via Composite-Order Graded Encoding

DOI10.1007/978-3-662-46497-7_21zbMath1382.94049OpenAlexW2169673773MaRDI QIDQ5261690

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

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

Related Items (30)

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

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