On the relationship between functional encryption, obfuscation, and fully homomorphic encryption

DOI10.1007/978-3-642-45239-0_5MaRDI QIDQ2870085zbMATH OpenOpenAlexFDO

Authors Joël Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, S. Dov Gordon, Stefano Tessaro, David A. Wilson

Publication date 17 January 2014

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1822/37239

zbMATH Keywords

homomorphic encryptionfunctional encryptionobfuscationrandomized functionality

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
• When does functional encryption imply obfuscation?
• Functional encryption for randomized functionalities
• Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
• Functional encryption: deterministic to randomized functions from simple assumptions

Cited in

(8)

• Foundations of functional encryption
• A survey on functional encryption
• Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits
• Verifiable computation for randomized algorithm
• Match me if you can: matchmaking encryption and its applications
• Functional encryption: deterministic to randomized functions from simple assumptions
• scientific article; zbMATH DE number 7561499 (Why is no real title available?)
• Functional encryption for randomized functionalities in the private-key setting from minimal assumptions

This page was built for publication: On the relationship between functional encryption, obfuscation, and fully homomorphic encryption

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