Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

DOI10.1007/978-3-642-54242-8_1zbMath1310.94134OpenAlexW2166561215MaRDI QIDQ5746330

Zvika Brakerski, Guy N. Rothblum

Publication date: 18 February 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_1

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (58)

One-Way Functions and (Im)perfect Obfuscation ⋮ Obfuscating finite automata ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Impossibility of order-revealing encryption in idealized models ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation ⋮ Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Secret-sharing for NP ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Proofs of Work from worst-case assumptions ⋮ Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On virtual grey box obfuscation for general circuits ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input ⋮ How to obfuscate MPC inputs ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Indistinguishability obfuscation ⋮ Obfuscating conjunctions ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ On the complexity of compressing obfuscation ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ White-box cryptography: don't forget about grey-box attacks ⋮ Candidate iO from homomorphic encryption schemes ⋮ Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings ⋮ On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ On the Correlation Intractability of Obfuscated Pseudorandom Functions ⋮ Perfect Structure on the Edge of Chaos ⋮ Cryptographic Assumptions: A Position Paper ⋮ How to build time-lock encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ Cutting-Edge Cryptography Through the Lens of Secret Sharing ⋮ Functional Encryption Without Obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Obfuscating circuits via composite-order graded encoding ⋮ Constrained pseudorandom functions from functional encryption ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Shorter Circuit Obfuscation in Challenging Security Models ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ Obfuscation Combiners ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Cryptanalyses of Candidate Branching Program Obfuscators

This page was built for publication: Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding