Expressive search on encrypted data

Lai, Junzuo; Zhou, Xuhua; Deng, Robert H.; Li, Yingjiu; Chen, Kefei

doi:10.1145/2484313.2484345

Cited by 51 publications

(44 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The other asymmetric solution was provided by Di Crescenzo et al in [25], where the authors designed a public-key encryption scheme with keyword search based on a variant of the quadratic residuosity problem. To support more complex queries, conjunctive keyword search, subset query and range query over encrypted data have also been proposed in [7,9,14,26,27].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

2016

View full text Add to dashboard Cite

Existing Searchable Encryption (SE) solutions are able to handle simple Boolean search queries, such as single or multi-keyword queries, but cannot handle substring search queries over encrypted data that also involve identifying the position of the substring within the document. These types of queries are relevant in areas such as searching DNA data. In this paper, we propose a tree-based Substring Position Searchable Symmetric Encryption (SSP-SSE) to overcome the existing gap. Our solution efficiently finds occurrences of a given substring over encrypted cloud data. Specifically, our construction uses the position heap tree data structure and achieves asymptotic efficiency comparable to that of an unencrypted position heap tree. Our encryption takes O(kn) time, and the resulting ciphertext is of size O(kn), where k is a security parameter and n is the size of stored data. The search takes O(m 2 + occ) time and three rounds of communication, where m is the length of the queried substring and occ is the number of occurrences of the substring in the document collection. We prove that the proposed scheme is secure against chosen-query attacks that involve an adaptive adversary. Finally, we extend SSP-SSE to the multi-user setting where an arbitrary group of cloud users can submit substring queries to search the encrypted data.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In order to enable search over encrypted data, many Searchable Encryption (SE) schemes have been proposed in recent years [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. (Note, we use the term searchable encryption somewhat loosely to include schemes, such as private information retrieval, as well.)…”

Section: Introductionmentioning

confidence: 99%

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

2016

View full text Add to dashboard Cite

show abstract

“…Although our proposed schemes have functional advantages which are shown in Table through comparing with other analogous schemes , DU cannot reconstruct the original file until N file slices have been gained from CSPs. In addition, in actual applications DU cannot restore the whole file f i because of single‐point failure.…”

Section: The Proposed Schemesmentioning

confidence: 99%

“…Then, we theoretically show the computational complexity among our proposed schemes and other analogous schemes. Moreover, we conduct empirical study over a real‐world dataset to show the efficiency and feasibility of our proposed schemes through comparing with ESED , ESPK schemes.…”

Section: Security and Performance Analysismentioning

confidence: 99%

Efficient keyword search over encrypted data in multi-cloud setting

Miao

2016

Security Comm. Networks

View full text Add to dashboard Cite

With the emergence of cloud storage, enabling cloud clients to securely store and efficiently retrieve ciphertext is a fundamental issue in cloud computing as data outsourcing can greatly ease heavy computation and management burden locally. Unfortunately, two challenging issues (i.e., data security and privacy) dramatically impede the adaption and practicability of cloud storage due to honest‐but‐curious cloud service provider (CSP). Furthermore, data encryption mechanism seriously makes the information retrieval over ciphertext extremely difficult. Besides, dealing with single CSP is predicted to become less popular with cloud customers for fear of risks of single‐point failure threats and potential malicious insiders. To this end, we propose two efficient keyword search over encrypted data in multi‐cloud setting schemes which exploit Identity‐Based Encryption (IBE) and Key‐Policy Attribute‐Based Encryption (KP‐ABE), respectively. Formal security analysis proves that our schemes can guarantee data privacy and reliability. As a further contribution, experimental results over real‐world dataset show that our proposed schemes are feasible and efficient in practical applications. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…Liu et al [16] proposed an efficient privacy preserving keyword search scheme in cloud computing, which allows service providers to participate in partial decipherment to reduce computational overhead in decryption for users. Lai et al [17] proposed a scheme of efficient and expressive search on encrypted data which supports arbitrary monotone boolean predicates.…”

Section: Related Workmentioning

confidence: 99%

A shareable keyword search over encrypted data in cloud computing

Weng

Yuan

et al. 2015

J Supercomput

View full text Add to dashboard Cite

Cloud storage is one of the most important applications in our daily lives. User can store their own data into cloud storage and remotely access the saved data. Owing to the social media develops, users can share the digital files to other users, leading to the amount of data growing rapidly and searching abilities necessarily. In the some cases, servers cannot avoid data leakage even if the server provides complete access control. The encrypted data is a best way to resolve this problem but it may eliminate original structure and searching may become impossible. Applying searchable encryption for each receiver may produce messy duplication and occupy the quota of cloud storage from each receiver. User requires keeping their shared documents belonging up to date which are compared with the latest version. To this B Hung-Min Sun

show abstract

Expressive search on encrypted data

Cited by 51 publications

References 42 publications

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

Efficient keyword search over encrypted data in multi-cloud setting

A shareable keyword search over encrypted data in cloud computing

Contact Info

Product

Resources

About