Compactness vs Collusion Resistance in Functional Encryption

DOI10.1007/978-3-662-53644-5_17zbMath1412.94189OpenAlexW2535859613MaRDI QIDQ3181036

Daniele Micciancio, Baiyu Li

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_17

zbMATH Keywords

functional encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ FE and iO for Turing machines from minimal assumptions ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Optimal bounded-collusion secure functional encryption ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Streaming functional encryption ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Simple and generic constructions of succinct functional encryption ⋮ Obfustopia built on secret-key functional encryption

Cites Work

• Unnamed Item
• On best-possible obfuscation
• Equational security proofs of oblivious transfer protocols
• Time-Lock Puzzles from Randomized Encodings
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Practical Multilinear Maps over the Integers
• Functional Encryption: New Perspectives and Lower Bounds
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• Functional Re-encryption and Collusion-Resistant Obfuscation
• Cryptanalysis of the Multilinear Map over the Integers
• An equational approach to secure multi-party computation
• Single-Key to Multi-Key Functional Encryption with Polynomial Loss
• From Selective to Adaptive Security in Functional Encryption
• A Punctured Programming Approach to Adaptively Secure Functional Encryption
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• New Multilinear Maps Over the Integers
• Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
• Indistinguishability Obfuscation from Compact Functional Encryption
• Functional Encryption: Origins and Recent Developments
• Candidate Multilinear Maps from Ideal Lattices
• How to use indistinguishability obfuscation
• Function-Private Functional Encryption in the Private-Key Setting
• Graph-Induced Multilinear Maps from Lattices
• Obfuscating Circuits via Composite-Order Graded Encoding
• On the (im)possibility of obfuscating programs
• Protecting Obfuscation against Algebraic Attacks
• Reusable garbled circuits and succinct functional encryption
• Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

This page was built for publication: Compactness vs Collusion Resistance in Functional Encryption