Single-Key to Multi-Key Functional Encryption with Polynomial Loss

DOI10.1007/978-3-662-53644-5_16zbMath1412.94175OpenAlexW2538236914MaRDI QIDQ3181035

Sanjam Garg, Akshayaram Srinivasan

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_16

zbMATH Keywords

secret keyfunctional encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ 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 ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ Streaming functional encryption ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to 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 ⋮ Constrained pseudorandom functions from functional encryption

Cites Work

• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Functional Encryption for Turing Machines
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• Adaptively Secure Garbled Circuits from One-Way Functions
• Constrained Pseudorandom Functions and Their Applications
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption: Definitions and Challenges
• 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
• An Identity Based Encryption Scheme Based on Quadratic Residues
• How to use indistinguishability obfuscation
• Breaking the Sub-Exponential Barrier in Obfustopia
• Fuzzy Identity-Based Encryption
• Functional Signatures and Pseudorandom Functions
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Attribute-based encryption for circuits
• Reusable garbled circuits and succinct functional encryption

This page was built for publication: Single-Key to Multi-Key Functional Encryption with Polynomial Loss