Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
From MaRDI portal
Publication:3179266
DOI10.1137/15M1034064zbMath1356.94048WikidataQ120907922 ScholiaQ120907922MaRDI QIDQ3179266
Publication date: 21 December 2016
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (33)
One-Way Functions and (Im)perfect Obfuscation ⋮ Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ The Journey from NP to TFNP Hardness ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Hierarchical identity-based inner product functional encryption ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Augmented random oracles ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Function-private functional encryption in the private-key setting ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ On the complexity of compressing obfuscation ⋮ From Minicrypt to Obfustopia via Private-Key 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? ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Obfustopia built on secret-key functional encryption ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Bounded KDM Security from iO and OWF ⋮ Unnamed Item ⋮ The Complexity of Public-Key Cryptography ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions ⋮ On subset-resilient hash function families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On best-possible obfuscation
- Indistinguishability Obfuscation: From Approximate to Exact
- Perfect Structure on the Edge of Chaos
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
- On the Practical Security of Inner Product Functional Encryption
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Homomorphic Encryption: From Private-Key to Public-Key
- Functional Encryption: Definitions and Challenges
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- On Security Preserving Reductions – Revised Terminology
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- On obfuscating point functions
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
- A Pseudorandom Generator from any One-way Function
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- How to use indistinguishability obfuscation
- Function-Private Functional Encryption in the Private-Key Setting
- Functional Encryption for Randomized Functionalities
- Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- On Obfuscation with Random Oracles
- Obfuscation of Probabilistic Circuits and Applications
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Multi-input Functional Encryption
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Theory of Cryptography
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- On Extractability Obfuscation
- Two-Round Secure MPC from Indistinguishability Obfuscation
- One-Way Functions and (Im)perfect Obfuscation
This page was built for publication: Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
