Public Key Encryption with Conjunctive Field Keyword Search

By Dong Jin Park, Kihyun Kim, Pil Joong Lee. Web Information System and Application Conference, 2004

339 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Information Systems

View Paper: https://www.semanticscholar.org/paper/6fc23b1d07ba921647a76b6aba0106897305d1dd

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

In Information Systems

Citations in the corpus

Achieving Efficient Conjunctive Keyword Searches over Encrypted Data (2005, methodology): “We note that while the schemes in [ 25 ] are in the public-key setting, they are still more efficient than previous symmetric constructions presented in [18].”
Parallel and Dynamic Searchable Symmetric Encryption (2013, background): “This includes conjunctive queries in the symmetric key setting [10]; it also includes conjunctive queries [16,2], comparison and subset queries [2], and range queries [17] in the public-key setting.”
Cryptographic Cloud Storage (2010, background): “Several works have shown how to achieve more complex search queries in the public-key setting, including conjunctive searches [28, 13] and range queries [13, 31].”
A Survey of Provably Secure Searchable Encryption (2014, neutral): “Hwang and Lee compare the efficiency of their scheme with both PKL schemes [Park et al. 2004] (cf.”
Off-Line Keyword Guessing Attacks on Recent Keyword Search Schemes over Encrypted Data (2006, methodology): “In particular, let’s suppose an e-mail system which is a major application area of keyword search scheme based on public key encryption [3, 13 ].”
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, methodology): “Park, Kim, and Lee introduced two efficient constructions that can search keywords conjunctively in a public key setting [26].”
Searchable symmetric encryption: Improved definitions and efficient constructions (2006, neutral): “Initialization: a) scan D and build ∆ ′ , the set of distinct words in D .”
An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks (2017, methodology): “As shown in Table 1, the computation costs of the PEKS, the Trapdoor and Test algorithms of our PAEKS scheme are comparable with those of the schemes in [7], [24], [3] and [4].”