On the (im)possibility of obfuscating programs
From MaRDI portal
Publication:5395678
DOI10.1145/2160158.2160159zbMath1281.68118OpenAlexW2084641398MaRDI QIDQ5395678
Ke Yang, Russell Impagliazzo, Steven Rudich, Boaz Barak, Oded Goldreich, Amit Sahai, Salil P. Vadhan
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:12644697
cryptographypseudorandom functionscomplexity theoryRice's theoremhomomorphic encryptionsoftware watermarkingstatistical zero knowledgesoftware protection
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Lockable obfuscation from circularly insecure fully homomorphic encryption, The direction of updatable encryption does matter, No-directional and backward-leak uni-directional updatable encryption are equivalent, Nonmalleable digital lockers and robust fuzzy extractors in the plain model, Additive randomized encodings and their applications, One-Way Functions and (Im)perfect Obfuscation, Constraining and Watermarking PRFs from Milder Assumptions, Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration, Code obfuscation against abstraction refinement attacks, Cutting-edge cryptography through the lens of secret sharing, A simple construction of iO for Turing machines, Watermarking PRFs under standard assumptions: public marking and security with extraction queries, Fiat-Shamir for highly sound protocols is instantiable, Limits on the Power of Indistinguishability Obfuscation and Functional Encryption, Secret Sharing for mNP: Completeness Results, A Punctured Programming Approach to Adaptively Secure Functional Encryption, Constructions for quantum indistinguishability obfuscation, A note on perfect correctness by derandomization, Standard Security Does Not Imply Indistinguishability Under Selective Opening, Secure Obfuscation in a Weak Multilinear Map Model, From Cryptomania to Obfustopia Through Secret-Key Functional Encryption, Compactness vs Collusion Resistance in Functional Encryption, Survey of information security, Another step towards realizing random oracles: non-malleable point obfuscation, Watermarking Cryptographic Capabilities, COA-secure obfuscation and applications, Watermarking PRFs against quantum adversaries, Storing and Retrieving Secrets on a Blockchain, Traceable PRFs: Full Collusion Resistance and Active Security, From cryptomania to obfustopia through secret-key functional encryption, From minicrypt to obfustopia via private-key functional encryption, New approaches to traitor tracing with embedded identities, 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, The random oracle model: a twenty-year retrospective, Registered attribute-based encryption, Structure-preserving compilers from new notions of obfuscations, On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input, Towards Proofs of Ownership Beyond Bounded Leakage, Unidirectional updatable encryption and proxy re-encryption from DDH, Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes, Watermarkable public key encryption with efficient extraction under standard assumptions, Multikey Fully Homomorphic Encryption and Applications, Maliciously secure massively parallel computation for all-but-one corruptions, Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication, Beyond software watermarking: traitor-tracing for pseudorandom functions, The final nail in the coffin of statistically-secure obfuscator, Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation, The hunting of the SNARK, Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions, Quantum cryptography beyond quantum key distribution, Secure software leasing from standard assumptions, Post-quantum resettably-sound zero knowledge, Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds, Leakage-resilient cryptography from puncturable primitives and obfuscation, Offline witness encryption with semi-adaptive security, Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES, Maximal incompleteness as obfuscation potency, Functional encryption for randomized functionalities in the private-key setting from minimal assumptions, Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions, Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES, Efficient obfuscation for CNF circuits and applications in cloud computing, On the complexity of compressing obfuscation, Constraining Pseudorandom Functions Privately, Predictable Arguments of Knowledge, From Minicrypt to Obfustopia via Private-Key Functional Encryption, Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE, On Removing Graded Encodings from Functional Encryption, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Watermarking cryptographic functionalities from standard lattice assumptions, Simple and generic constructions of succinct functional encryption, 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, Reconfigurable Cryptography: A Flexible Approach to Long-Term Security, Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation, How to build time-lock encryption, Obfustopia built on secret-key functional encryption, On Constructing One-Way Permutations from Indistinguishability Obfuscation, Can PPAD hardness be based on standard cryptographic assumptions?, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, 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, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, Offline Witness Encryption, Universal proxy re-encryption, A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation, Obfuscation Combiners, On Statistically Secure Obfuscation with Approximate Correctness, Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium, Leakage resilience from program obfuscation, How to Use Indistinguishability Obfuscation: Deniable Encryption, and More, Does Looking Inside a Circuit Help, Unnamed Item, Instantiation of quantum point obfuscation, The Complexity of Public-Key Cryptography, Pseudorandom Functions: Three Decades Later, A Note on Perfect Correctness by Derandomization, Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software, Breaking the Sub-Exponential Barrier in Obfustopia, Ad Hoc PSM Protocols: Secure Computation Without Coordination
