How to Obfuscate Programs Directly

DOI10.1007/978-3-662-46803-6_15zbMath1371.68054MaRDI QIDQ2948392

Joe Zimmerman

Publication date: 30 September 2015

Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_15

Mathematics Subject Classification ID

94A60: Cryptography

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Practical Order-Revealing Encryption with Limited Leakage, The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, Lattice-Based SNARGs and Their Application to More Efficient Obfuscation, Cryptanalyses of Candidate Branching Program Obfuscators, On the complexity of compressing obfuscation, Constraining Pseudorandom Functions Privately, Universal Samplers with Fast Verification, Zeroizing Attacks on Indistinguishability Obfuscation over CLT13, Separating IND-CPA and Circular Security for Unbounded Length Key Cycles, Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption, 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, Obfustopia built on secret-key functional encryption, The random oracle model: a twenty-year retrospective, Cutting-edge cryptography through the lens of secret sharing, The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks, On the bit security of cryptographic primitives, Homomorphic lower digits removal and improved FHE bootstrapping, Anonymous IBE, leakage resilience and circular security from new assumptions, Proofs of Work from worst-case assumptions, On virtual grey box obfuscation for general circuits, How to build time-lock encryption, Efficient obfuscation for CNF circuits and applications in cloud computing, Obfuscating circuits via composite-order graded encoding, New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries, Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE, Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact, Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications, Multilinear maps from obfuscation, Efficient and scalable universal circuits, Constrained pseudorandom functions from functional encryption, Cryptanalysis of the CLT13 multilinear map, 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, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, Shorter Circuit Obfuscation in Challenging Security Models, Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium, Efficient and Provable White-Box Primitives