Towards asymmetric searchable encryption with message recovery and flexible search authorization

Tang, Qiang; Chen, Xiaofeng

doi:10.1145/2484313.2484346

Cited by 12 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Boneh et al introduced the Asymmetric Searchable Encryption in Reference through their public key encryption with keyword search (PEKS) schema. Many other Asymmetric Searchable Encryption schemes followed such as References , .…”

Section: Related Workmentioning

confidence: 99%

Toward a big data approach for indexing encrypted data in Cloud Computing

Kaci

Bouabana-Tebibel

Rachedi

et al. 2019

Security and Privacy

View full text Add to dashboard Cite

Searchable encryption provides encryption schemes allowing search on encrypted data without decrypting the whole collection. However, due to the huge amount of data that exists in the Cloud, it is required to review such encryption schemes to decrease search and indexation times. In this paper, we propose a big data approach called MR‐Index (MapReduce Indexation) that makes the indexation mechanism parallel. In fact, the proposed MR‐Index is composed of two phases: Map phase and Reduce phase. In the Map phase, MR‐Index processes documents in parallel to build for each keyword, the list of identifiers of documents containing it. Access control is ensured through attribute based encryption. In the reduce phase of MR‐Index, the data structures of the index are constructed. The MR‐Index is performed by a trusted party called searchable encryption authority. Experimental results, shown that the proposed solution decreases the indexation time for large documents, compared to the original sequential indexation mechanism. In terms of scalability of the solution, we ameliorated the MR‐Index using the Hadoop archive files.

show abstract

Section: Related Workmentioning

confidence: 99%

Toward a big data approach for indexing encrypted data in Cloud Computing

Kaci

Bouabana-Tebibel

Rachedi

et al. 2019

Security and Privacy

View full text Add to dashboard Cite

show abstract

“…Yang et al [25] proposed a scheme of multi-user private keyword search for cloud computing, especially for enterprise-outsourcing-database-to-cloud settings, in which multiple entitled users can search and write to the database. Tang et al [26] proposed an asymmetric searchable encryption scheme, in which data owner can keep data encrypted while still being able to recover the plaintext and authorize third-party servers to search.…”

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

“…For certificate-based keyword search, the data owner encrypts keywords and data with the public key of the target user, so that the target user can use his own private key to generate the search token and then conduct the search on keyword ciphertexts. Many solutions, e.g., [5,4,7,1,9,10,30,26,29], have been proposed after [6] initiated the first study. While certificate-based keyword search is more flexible compared with symmetric key based keyword search, it requires the data owner validating the target user's public key before encrypting keywords.…”

Section: Related Workmentioning

confidence: 99%

CLKS: Certificateless Keyword Search on Encrypted Data

Zheng

Azgin

2015

Network and System Security

View full text Add to dashboard Cite

Keyword search on encrypted data enables one to search keyword ciphertexts without compromising keyword security. We further investigate this problem and propose a novel variant, dubbed certificateless keyword search on encrypted data (CLKS). CLKS not only supports keyword search on encrypted data, but also brings promising features due to the certificateless cryptography. In contrast to the certificated-based keyword search, CLKS requires no validation on the trustworthy of the public key before encrypting keywords; in contrast to the identity-based keyword search, CLKS prevents the key issuer (e.g., key generator center) from penetrating any information on keyword ciphertexts by leveraging the capability of accessing all data users' (partial) private keys. Specifically, we rigorously define the syntax and security definitions for CLKS, and present the construction that is provably secure in the standard model under the Decisional Linear assumption. We implemented the proposed CLKS scheme and evaluated its performance. To the best of our knowledge, this is the first attempt to integrate certificateless cryptography with keyword search on encrypted data.

show abstract

Towards asymmetric searchable encryption with message recovery and flexible search authorization

Cited by 12 publications

References 15 publications

Toward a big data approach for indexing encrypted data in Cloud Computing

Toward a big data approach for indexing encrypted data in Cloud Computing

A shareable keyword search over encrypted data in cloud computing

CLKS: Certificateless Keyword Search on Encrypted Data

Contact Info

Product

Resources

About