Public Key Encryption with Keyword Search

By Dan Boneh, Giovanni Di Crescenzo, Rafail M. Ostrovsky, Giuseppe Persiano. International Conference on the Theory and Application of Cryptographic Techniques, 2004

3,500 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

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

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

In Computer Vision and Pattern Recognition

Citations in the corpus

Data Security and Privacy-Preserving in Edge Computing Paradigm: Survey and Open Issues (2018, methodology): “problem [96] (DDH), Bilinear Diffie-Hellman problem [95], [97] (BDH), and so on.”
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions (2018, background): “[171] to achieve encrypted mails search on untrusted mailing servers.”
Efficient verifiable fuzzy keyword search over encrypted data in cloud computing (2013, methodology): “Traditional searchable encryption schemes (SSE) [3], [5], [6], [7], [10], [11], [12], [19] have been proposed in recent years.”
Generic Attacks on Secure Outsourced Databases (2016, methodology): “Broadly, the techniques include multi-party computation [47, 24], oblivious RAM [25, 25], searchable symmetric and structural encryp-1330 tion [45, 22, 13, 15, 14, 12, 40, 19, 33], functional encryption [9, 43], property-preserving encryption [5, 1, 7, 39] and homomorphic encryption [10, 21].”
Private Searching on Streaming Data (2005, background): “, see [4] and the references therein ).”
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage (2017, background): “[28] presented the notion of public key encryption with keyword search schemes which provides an approach to track over the encrypted”
A Survey of Provably Secure Searchable Encryption (2014, neutral): “…generalized Assumption 1 from Katz et al. [2008] (GKA1), (2) the generalized three-party DiffieHellman (C3DH) [Boneh and Waters 2007] assumption, and (3) the decisional ACM Computing Surveys, Vol. 47, No. 2, Article 18, Publication date: August 2014. linear (DLIN) assumption [Boneh et al. 2004a].”
Public Key Encryption with Conjunctive Field Keyword Search (2004, methodology): “However, schemes in [ 4 , 12] are inappropriate for a conjunctive keyword search, such as finding “urgent” email form “Bob” about “finance”.”
An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks (2017, methodology): “[7, 4], keywords may be revealed due to the leakage of search patterns [28].”
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, methodology): “[9] introduced Public Key Encryption with Keyword Search (PEKS), where any party with access to a public key could make an encrypted document that was searchable by keyword; they realized their construction by applying the Boneh-Franklin IBE scheme.”
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, background): “A related line of work called predicate encryption or searching on encrypted data attempts to evaluate predicates over the encrypted data itself [39, 12, 1, 16, 15, 37, 29].”
Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement (2016, background): “[5] propose the first public key-based searchable encryption scheme, where anyone owning the private key can search data items encrypted by the public key.”
Predicate Privacy in Encryption Systems (2009, background): “Prior work on public-key predicate encryption [7, 12, 1, 9, 19, 11, 28, 27] has focused on the security property that ciphertexts reveal no information about the underlying plaintext or data other than what is implied by the tokens in one’s possession.”
Structured Encryption and Controlled Disclosure (2010, background): “Searchable encryption has also been considered in the public-key setting [5,35,1,9,7,8].”
Fully homomorphic SIMD operations (2012, methodology): “In some sense this is akin to the basic premise of public key encryption with keyword search [1], however we have a more complicated data retrieval operation to perform.”
Public Key Encryption with Keyword Search Revisited (2008, methodology): “(2) The scheme in [6] uses a secure (encrypted and authenticated) channel between Alice and the email server.”