From Cryptomania to Obfustopia Through Secret-Key Functional Encryption

DOI10.1007/978-3-662-53644-5_15zbMath1400.94122OpenAlexW2532362725MaRDI QIDQ3181034

Alain Passelègue, Daniel Wichs, Ryo Nishimaki, Nir Bitansky

Publication date: 22 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (26)

Impossibility of simulation secure functional encryption even with random oracles ⋮ FE and iO for Turing machines from minimal assumptions ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Optimal bounded-collusion secure functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Indistinguishability obfuscation ⋮ 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 ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Cryptography with Updates ⋮ Candidate iO from homomorphic encryption schemes ⋮ Constrained pseudorandom functions from functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Combiners for functional encryption, unconditionally ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Amplifying the security of functional encryption, unconditionally

Cites Work

• Unnamed Item
• Output-Compressing Randomized Encodings and Applications
• Functional Encryption for Turing Machines
• Indistinguishability Obfuscation with Non-trivial Efficiency
• Functional Encryption Without Obfuscation
• Multi-input Functional Encryption for Unbounded Arity Functions
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• Adaptively Secure Garbled Circuits from One-Way Functions
• Functional Encryption: New Perspectives and Lower Bounds
• On the Achievability of Simulation-Based Security for Functional Encryption
• Constrained Pseudorandom Functions and Their Applications
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Succinct Randomized Encodings and their Applications
• Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption: Definitions and Challenges
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
• Compactness vs Collusion Resistance in Functional Encryption
• Predicate Encryption for Circuits from LWE
• From Selective to Adaptive Security in Functional Encryption
• A Punctured Programming Approach to Adaptively Secure Functional Encryption
• Indistinguishability Obfuscation from Compact Functional Encryption
• A Depth-Universal Circuit
• 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
• Obfuscation of Probabilistic Circuits and Applications
• Breaking the Sub-Exponential Barrier in Obfustopia
• On the (im)possibility of obfuscating programs
• Functional Signatures and Pseudorandom Functions
• 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
• Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: From Cryptomania to Obfustopia Through Secret-Key Functional Encryption