Public Key Encryption with Keyword Search

Abstract

Abstract.We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice's public key. An email gateway wants to test whether the email contains the keyword "urgent" so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to test whether the word "urgent" is a keyword in the email without learning anything else about the email. We refer to this mechanism as Public Key Encryption with keyword Search. As another example, consider a mail server that stores various messages publicly encrypted for Alice by others. Using our mechanism Alice can send the mail server a key that will enable the server to identify all messages containing some specific keyword, but learn nothing else. We define the concept of public key encryption with keyword search and give several constructions.

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers

“…Secure computations on binary decision trees were introduced in [8], yet they have long execution time due to the use of the IBM HElib library. Searching an encrypted database was previeously addressed by [4], [6], [7], [14]. One drawback in [4], [6] was the need for a special key to aid the server in performing the search request.…”

“…Searching an encrypted database was previeously addressed by [4], [6], [7], [14]. One drawback in [4], [6] was the need for a special key to aid the server in performing the search request. They achieve a weaker security notion, namely one where partial information about the data access pattern is leaked.…”

“…The correctness of the multiplication operation can be noticed from the decryption operation in (6). Matrix dimensions are removed for clarity.…”

“…x [2] x [3] x [4] x [5] x [6] x [7] X is more suited for a GPU global memory architecture. This design was also attractive due to its hardware regularity, which is also better suited for the GPU kernels.…”

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

“…Identity-based encryption (IBE) [21,8,13,4,5,23] can be viewed as predicate encryption for the class of equality tests; the standard notion of security for IBE [8,12] corresponds to payload-hiding, while anonymous IBE [7,11,14] corresponds to the stronger notion of attribute hiding. Attribute-based encryption schemes [20,15,3,19] can also be cast in the framework of predicate encryption, though in this case all the listed constructions achieve payload hiding only.…”