Functional encryption for randomized functionalities in the private-key setting from minimal assumptions

DOI10.1007/978-3-662-46497-7_14MaRDI QIDQ5261683zbMATH OpenOpenAlexFDO

Authors Ilan Komargodski, Gil Segev, Eylon Yogev

Publication date 6 July 2015

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

Full work available at URL https://doi.org/10.1007/978-3-662-46497-7_14

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
• Functional encryption for randomized functionalities
• Functional encryption: deterministic to randomized functions from simple assumptions
• Function-private functional encryption in the private-key setting
• Function-private functional encryption in the private-key setting

Cited in

(21)

• Functional encryption against probabilistic queries: definition, construction and applications
• On Removing Graded Encodings from Functional Encryption
• Function-private functional encryption in the private-key setting
• Function-private functional encryption in the private-key setting
• scientific article; zbMATH DE number 6866298 (Why is no real title available?)
• On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
• Functional encryption for bounded collusions, revisited
• Functional encryption for randomized functionalities
• Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
• Making public key functional encryption function private, distributively
• Limits on the power of indistinguishability obfuscation and functional encryption
• From Minicrypt to Obfustopia via private-key functional encryption
• Verifiable computation for randomized algorithm
• (Multi-input) \textsf{FE} for randomized functionalities, revisited
• Private functional signatures: definition and construction
• Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
• Functional encryption: deterministic to randomized functions from simple assumptions
• Impossibility results for lattice-based functional encryption schemes
• From cryptomania to obfustopia through secret-key functional encryption
• Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
• Strongly full-hiding inner product encryption

This page was built for publication: Functional encryption for randomized functionalities in the private-key setting from minimal assumptions

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