On the complexity of compressing obfuscation
From MaRDI portal
Publication:5918748
DOI10.1007/s00145-022-09431-5zbMath1493.94027OpenAlexW2953382042MaRDI QIDQ5918748
Gilad Asharov, Rafael Pass, Naomi Sirkin, Ilan Komargodski
Publication date: 18 July 2022
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-022-09431-5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits on the power of garbling techniques for public-key encryption
- Bit commitment using pseudorandomness
- One way functions and pseudorandom generators
- Toward efficient agnostic learning
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Structure vs. hardness through the obfuscation lens
- When does functional encryption imply obfuscation?
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Non-trivial witness encryption and null-iO from standard assumptions
- On relationships between statistical zero-knowledge proofs
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Queries and concept learning
- Mining circuit lower bound proofs for meta-algorithms
- On PAC learning algorithms for rich Boolean function classes
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
- Indistinguishability Obfuscation: From Approximate to Exact
- Output-Compressing Randomized Encodings and Applications
- Perfect Structure on the Edge of Chaos
- Indistinguishability Obfuscation with Non-trivial Efficiency
- On Constructing One-Way Permutations from Indistinguishability Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscation Combiners
- On Statistically Secure Obfuscation with Approximate Correctness
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Constrained Pseudorandom Functions and Their Applications
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Constant depth circuits, Fourier transform, and learnability
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- List decoding algorithms for certain concatenated codes
- A complete problem for statistical zero knowledge
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Best-Possible Obfuscation
- A theory of the learnable
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- On the Fourier spectrum of monotone functions
- Indistinguishability Obfuscation from Functional Encryption
- Agnostic Learning from Tolerant Natural Proofs
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- How to use indistinguishability obfuscation
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Graph-Induced Multilinear Maps from Lattices
- Obfuscating Circuits via Composite-Order Graded Encoding
- A Note on Perfect Correctness by Derandomization
- Cryptanalyses of Candidate Branching Program Obfuscators
- Learning algorithms from natural proofs
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Protecting Obfuscation against Algebraic Attacks
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Multi-input Functional Encryption
- Witness encryption and its applications
- Reusable garbled circuits and succinct functional encryption
- Topics in Cryptology – CT-RSA 2005
- Theory of Cryptography
- 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
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Obfustopia built on secret-key functional encryption
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Multi-theorem preprocessing NIZKs from lattices
- Indistinguishability obfuscation from circular security
This page was built for publication: On the complexity of compressing obfuscation
