Protecting Obfuscation against Algebraic Attacks
From MaRDI portal
Publication:5418698
DOI10.1007/978-3-642-55220-5_13zbMath1332.94055OpenAlexW2221582088MaRDI QIDQ5418698
Yael Tauman Kalai, Boaz Barak, Amit Sahai, Sanjam Garg, Omer Paneth
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_13
Related Items (60)
One-Way Functions and (Im)perfect Obfuscation ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations ⋮ Indistinguishability Obfuscation from Compact Functional Encryption ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Secret-sharing for NP ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications ⋮ 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 ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Indistinguishability obfuscation ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ On the complexity of compressing obfuscation ⋮ Constraining Pseudorandom Functions Privately ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ 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 ⋮ Functional Encryption for Turing Machines ⋮ 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 ⋮ 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 ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ 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: Protecting Obfuscation against Algebraic Attacks