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 ObfuscationCutting-edge cryptography through the lens of secret sharingThe MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacksReturn of GGH15: provable security against zeroizing attacksZeroizing Without Low-Level Zeroes: New MMAP Attacks and their LimitationsIndistinguishability Obfuscation from Compact Functional EncryptionDelegating RAM Computations with Adaptive Soundness and PrivacySecure Obfuscation in a Weak Multilinear Map ModelVirtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic AgentsCompactness vs Collusion Resistance in Functional EncryptionSecret-sharing for NPCryptanalysis of candidate obfuscators for affine determinant programsMatrix PRFs: constructions, attacks, and applications to obfuscationPublic-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applicationsMultiparty noninteractive key exchange from ring key-homomorphic weak PRFsStructure-preserving compilers from new notions of obfuscationsOn virtual grey box obfuscation for general circuitsMultiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscationSelf-bilinear map on unknown order groups from indistinguishability obfuscation and its applicationsOn the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary inputPolynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)Indistinguishability obfuscationPractical Order-Revealing Encryption with Limited LeakageEfficient obfuscation for CNF circuits and applications in cloud computingOn the complexity of compressing obfuscationConstraining Pseudorandom Functions PrivatelyZeroizing Attacks on Indistinguishability Obfuscation over CLT13Robust Transforming Combiners from Indistinguishability Obfuscation to Functional EncryptionOn Removing Graded Encodings from Functional EncryptionFunctional Encryption: Deterministic to Randomized Functions from Simple AssumptionsWhite-box cryptography: don't forget about grey-box attacksCandidate iO from homomorphic encryption schemesImpossibility of VBB Obfuscation with Ideal Constant-Degree Graded EncodingsOn the Impossibility of Virtual Black-Box Obfuscation in Idealized ModelsLower Bounds on Assumptions Behind Indistinguishability ObfuscationIndistinguishability Obfuscation: From Approximate to ExactFunctional Encryption for Turing MachinesOn the Correlation Intractability of Obfuscated Pseudorandom FunctionsPerfect Structure on the Edge of ChaosCryptographic Assumptions: A Position PaperHow to build time-lock encryptionObfustopia built on secret-key functional encryptionHow to Avoid Obfuscation Using Witness PRFsCutting-Edge Cryptography Through the Lens of Secret SharingFunctional Encryption Without ObfuscationContention in Cryptoland: Obfuscation, Leakage and UCEObfuscating circuits via composite-order graded encodingConstrained pseudorandom functions from functional encryptionNew cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queriesCandidate iO from homomorphic encryption schemesIndistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplificationShorter Circuit Obfuscation in Challenging Security ModelsA Unified Approach to Idealized Model Separations via Indistinguishability ObfuscationUniversal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness EncryptionObfuscation CombinersRevisiting the Cryptographic Hardness of Finding a Nash EquilibriumAnnihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving SoftwareLattice-Based SNARGs and Their Application to More Efficient ObfuscationCryptanalyses of Candidate Branching Program Obfuscators




This page was built for publication: Protecting Obfuscation against Algebraic Attacks