Definitional Issues in Functional Encryption

By Adam O'Neill. IACR Cryptology ePrint Archive, 2010

303 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/98ca39c9e66e2e230e7593e294c1b2de284f131f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Brent Waters
2. Dan Boneh
3. Amit Sahai
4. Shai Halevi
5. Allison Bishop
6. Craig Gentry
7. Shafi Goldwasser
8. Vipul Goyal

Citations in the corpus

• Multi-Input Functional Encryption (2014, background): “How to define “does not learn anything about” x is a fascinating question which has been addressed by a number of papers, with general formal definitions first appearing in [6, 16].”
• Homomorphic Encryption (2017, background): “, [64, 84, 11, 75]), and some variants that support all functions but offer weaker security can be based on the hardness of LWE (e.”
• Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013, methodology): “This construction is described in the full-version [30].”