Functional Encryption: Definitions and Challenges

By Dan Boneh, Amit Sahai, Brent Waters. Theory of Cryptography Conference, 2011

1,041 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/c7a31ee1240a1e463d74f447dc11c930ce098543

How researchers see this paper

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

In Artificial Intelligence

1. Brent Waters
2. Dan Boneh
3. Amit Sahai
4. Craig Gentry
5. Vinod Vaikuntanathan
6. Shai Halevi
7. Mariana Raykova
8. Allison Bishop

In Computational Theory and Mathematics

1. Brent Waters
2. Amit Sahai
3. Shai Halevi
4. Dan Boneh
5. Craig Gentry
6. Vinod Vaikuntanathan
7. Allison Bishop
8. Nuttapong Attrapadung

Citations in the corpus

• SoK: Privacy on Mobile Devices – It’s Complicated (2016, background): “One particularly promising way to do this is through the use of advanced cryptographic techniques such as homomorphic encryption [167], secure multi-party computation [168, 169], and functional encryption [170].”
• Structured Encryption and Controlled Disclosure (2010, background): “Functional encryption [8] is a recent paradigm that generalizes work on a variety of problems including identity-based encryption [31, 6], attribute-based encryption [30, 22, 4], and predicate encryption [26, 32].”
• Outsourcing the Decryption of ABE Ciphertexts (2011, background): “1A more general concept of functional encryption [11] allows for more general functions to be computed on the encrypted data and encompasses work such as searching on encrypted data and predicate encryption [10, 2, 12, 39, 27].”
• Inference Attacks on Property-Preserving Encrypted Databases (2015, neutral): “There are various approaches to search on encrypted data including searchable symmetric encryption (SSE) [20, 37], fully-homomorphic encryption (FHE) [23], oblivious RAMs (ORAM) [24], functional encryption [15], and property-preserving encryption (PPE) [11,12].”
• Reusable garbled circuits and succinct functional encryption (2013, methodology): “Attribute-based encryption schemes were also called public-index predicate encryption schemes in the literature [9].”
• 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.”
• Obfuscator-LLVM -- Software Protection for the Masses (2015, background): “One usually refers to such an adversary as a white­box adversary [45].”
• Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (2011, methodology): “Our definition of FE here and throughout the paper refers to the class of predicate encryption with public index of [11].”
• : Privacy on Mobile Devices – It ’ s Complicated (2016, background): “One particularly promising way to do this is through the use of advanced cryptographic techniques such as homomorphic encryption [167], secure multi-party computation [168, 169], and functional encryption [170].”
• Multi-Input Functional Encryption (2014, background): “To address this issue, the notion of functional encryption (FE) was developed in a sequence of works [19, 13, 7, 14, 15, 6, 16, 18].”
• HybridAlpha: An Efficient Approach for Privacy-Preserving Federated Learning (2019, methodology): “stem that allows parties to encrypt their data, meanwhile, an external entity can compute a specific function on the ciphertext without learning anything additional from the underlying plaintext data [8]. For this purpose, a trusted third party (TPA) is used to set up a master private key and a mast”
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption (2012, background): “In this sense, KP-ABE can be thought of as a special-case of Functional Encryption [5] .”
• Practical Dynamic Searchable Encryption with Small Leakage (2014, background): “Related to searchable encryption is also functional encryption [4], [11], [28], where one encrypts the documents in a way that one can issue tokens that would allow testing whether a specific keyword is contained in the document, without decrypting the document.”
• Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013, background): “Recent work demonstrated that certain strong simulationbased formulations of the goal of functional encryption are impossible to meet [9], [39].”
• Functional Signatures and Pseudorandom Functions (2014, neutral): “[8].”