Single-key to multi-key functional encryption with polynomial loss

DOI10.1007/978-3-662-53644-5_16MaRDI QIDQ3181035zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
• Function-private functional encryption in the private-key setting
• Function-private functional encryption in the private-key setting
• From selective to adaptive security in functional encryption
• Functional encryption: definitions and challenges

Cites work

• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A proof of security of Yao's protocol for two-party computation
• A punctured programming approach to adaptively secure functional encryption
• Adaptively secure garbled circuits from one-way functions
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Attribute-based encryption for circuits
• Breaking the sub-exponential barrier in obfustopia
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Compactness vs collusion resistance in functional encryption
• Constrained pseudorandom functions and their applications
• From selective to adaptive security in functional encryption
• Functional Encryption for Turing Machines
• Functional encryption: definitions and challenges
• Functional signatures and pseudorandom functions
• Fuzzy Identity-Based Encryption
• How to use indistinguishability obfuscation
• Identity-based cryptosystems and signature schemes
• Indistinguishability obfuscation from compact functional encryption
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Predicate encryption for circuits from LWE
• Reusable garbled circuits and succinct functional encryption
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

Cited in

(18)

• Indistinguishability obfuscation from bilinear maps and LPN variants
• The pseudorandom oracle model and ideal obfuscation
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• FE and iO for Turing machines from minimal assumptions
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• 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
• Simple and generic constructions of succinct functional encryption
• Constrained (Verifiable) Pseudorandom Function from Functional Encryption
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
• Streaming functional encryption
• Obfustopia built on secret-key functional encryption
• On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
• Constrained pseudorandom functions from functional encryption
• Optimal bounded-collusion secure functional encryption
• Robust transforming combiners from indistinguishability obfuscation to functional encryption

This page was built for publication: Single-key to multi-key functional encryption with polynomial loss

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181035)