Functional Encryption Without Obfuscation

DOI10.1007/978-3-662-49099-0_18zbMath1382.94107OpenAlexW2295244449MaRDI QIDQ2799106

Craig Gentry, Sanjam Garg, Mark Zhandry, Shai Halevi

Publication date: 8 April 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_18

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (52)

Adaptive Simulation Security for Inner Product Functional Encryption ⋮ (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Multi-input quadratic functional encryption from pairings ⋮ A New Functional Encryption for Multidimensional Range Query (Short Paper) ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Cryptanalysis of multilinear maps from ideal lattices: revisited ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Universally Composable Cryptographic Role-Based Access Control ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ A survey on functional encryption ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Streaming functional encryption ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Public key encryption with equality test from generic assumptions in the random oracle model ⋮ Arrangements of Pseudocircles: Triangles and Drawings ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Function-private functional encryption in the private-key setting ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Simplifying Design and Analysis of Complex Predicate Encryption Schemes ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Cryptography with Updates ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Multi-input Functional Encryption and Its Application in Outsourcing Computation ⋮ Constrained pseudorandom functions from functional encryption ⋮ Simple and efficient FE for quadratic functions ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Multi-client functional encryption for separable functions ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ A new approach to practical function-private inner product encryption ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Unnamed Item ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Cryptanalyses of Candidate Branching Program Obfuscators

Cites Work

• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Key Homomorphic PRFs and Their Applications
• Practical Multilinear Maps over the Integers
• Functional Encryption: New Perspectives and Lower Bounds
• Constrained Pseudorandom Functions and Their Applications
• Witness Encryption from Instance Independent Assumptions
• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Cryptanalysis of the Multilinear Map over the Integers
• Functional Encryption: Definitions and Challenges
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• From Selective to Adaptive Security in Functional Encryption
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• New Multilinear Maps Over the Integers
• Indistinguishability Obfuscation from Compact Functional Encryption
• Practical Identity-Based Encryption Without Random Oracles
• Candidate Multilinear Maps from Ideal Lattices
• Function-Private Functional Encryption in the Private-Key Setting
• Efficient Identity-Based Encryption Without Random Oracles
• Functional Signatures and Pseudorandom Functions
• Protecting Obfuscation against Algebraic Attacks
• Witness encryption and its applications
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

This page was built for publication: Functional Encryption Without Obfuscation