Oblivious Conjunctive Keyword Search

Rhee, Hyun Sook; Byun, Jin Wook; Lee, Dong Hoon; Lim, Jongsik

doi:10.1007/11604938_25

Cited by 11 publications

(19 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In short, DOKS needs to transfer m(n+2)|p| bits, and the total computation is about (2n+6m+1) module exponentiations (E) and m(n+1) module multiplications (M), while the OKS protocol in [7] needs more than (mn+2) E; and the OKS protocol in [9] needs more than (2mn+n+1) E. DOKS needs to store with n ciphertexts, while [7], [8] and [9] stores mn ciphertexts.…”

Section: Doks Feasibility Analysismentioning

confidence: 99%

Secure Cloud Storage Service with an Efficient DOKS Protocol

Jiang

Liu

2013

2013 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

Abstract-Storage services based on public clouds provide customers with elastic storage and on-demand accessibility. However, moving data to remote cloud storage also raises privacy concerns. Cryptographic cloud storage and search over encrypted data have attracted attentions from both industry and academics. In this paper, we present a new approach to constructing efficient oblivious keyword search (OKS) protocol, which permits fast search (i.e., sub-linear time) and relatively short ciphertext, while providing provably strong privacy for both users and cloud storage service providers. Previous OKS protocols have ciphertext size linear in the number of keywords, which consume much storage space and relatively long searching time. We formally define a Disjunctively Oblivious Keyword Search (DOKS) protocol realizing oblivious keyword search with the ciphertext size constant in size of keywords, which is significantly less than that of previous OKS protocols. Our approach improves both the privacy and efficiency of existing OKS protocols. With DOKS, adversary cannot distinguish two search keywords submitted by users, and cannot know the relations between ciphertext of documents and search keywords. A search keyword cannot be reused by adversaries. Users can get the matching documents without revealing statistical information on search keywords.

show abstract

Section: Doks Feasibility Analysismentioning

confidence: 99%

Secure Cloud Storage Service with an Efficient DOKS Protocol

Jiang

Liu

2013

2013 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

show abstract

“…introduced an oblivious keyword search scheme, which makes a user can retrieve data that contain a keyword. Later this scheme is improved by H. S. Rhee [7] .…”

Section: Related Workmentioning

confidence: 99%

Cloud Storage-oriented Secure Information Gateway

Zhang

Zhu

Bian

et al. 2012

2012 International Conference on Cloud and Service Computing

View full text Add to dashboard Cite

The Secure Channel Free Public Key Encryption with Keyword Search (SCF-PEKS) scheme, which enables one to search for the encrypted keywords without leaking the privacy. In this paper, we point out the inefficiency of SCF-PEKS scheme and construct a new Located Secure Channel Free Public Key Encryption with Keyword Search (LSCF-PEKS) scheme to improve the efficiency. Furthermore, the LSCF-PEKS scheme is applied to implement cloud storage-oriented secure information gateway. At last, a bidding system is implemented as a case of this scenario. Index Terms-cloud storage, public key encryption, bidding system, keyword searchUnrecognized Copyright Information

show abstract

“…To resolve this problem, keyword search over encrypted data has received close attention in various environments such as encrypted web hard-systems, intelligent email routing, encrypted vendor systems, etc. (Song et al, 2000;Golle et al, 2004;Ogata and Kurosawa, 2004;Park et al, 2004;Rhee et al, 2006;Boneh and Waters, 2007;Hwang and Lee, 2007;Katz et al, 2008). Keyword search enables a user to search encrypted data without revealing any information on the query and data, even to the database server.…”

Section: Introductionmentioning

confidence: 97%

“…Ogata et al suggested an oblivious keyword search scheme that uses oblivious transfer. The scheme was subsequently improved by Rhee et al (2006). The third type is a store-and-forward system, such as an email system, where a receiver can search data that are encrypted under the receiver's public key on a storage system.…”

Section: Introductionmentioning

confidence: 99%