scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Algorithm for Multi Keyword Search Over Encrypted Data in Cloud Environment

TL;DR: A secure and efficient encryption scheme to encrypt the data stored in the cloud as well as the queries along with a multi-keyword search scheme to search over the encrypted cloud data is proposed.
Abstract: Cloud Computing offers storage resources as well as network and computing resources to the organizations. This eliminates the high infrastructure cost for the organizations that are using these services as they can now dynamically pay for these services, i.e., pay per use model, which is followed by most of the cloud providers. As the organization does not locally host these resources, these are comparatively far easier to manage and use than the traditional infrastructural resources. As a result of these factors, the popularity of cloud computing is increasing continuously. But this transfer of data and applications to the cloud server also creates some challenges. It poses problems that must be dealt with properly to ensure a secure cloud computing environment. As more and more sensitive data is being uploaded on the cloud in the present scenario, the privacy and security concerns associated with the data is continuously increasing. To address this, issue the data is stored on the cloud in the encrypted form. Also, as the amount of data stored is usually tremendous, so an efficient search scheme is also necessary. So here, we deal with two significant aspects of cloud computing: Encryption and Searching. We are proposing a secure and efficient encryption scheme to encrypt the data stored in the cloud as well as the queries along with a multi-keyword search scheme to search over the encrypted cloud data.
Citations
More filters
Journal ArticleDOI
TL;DR: Wang et al. as discussed by the authors proposed a new searchable signcryption scheme for WBAN, which is proved to simultaneously achieve ciphertext indistinguishability, trapdoor indistinguishment, ciphertext unforgeability and the resistance of KGA and IKGA in the random oracle model (ROM).
Abstract: The Wireless body area network (WBAN) is a network composed of sensors communicating through wireless technology, these sensors can capture and encrypt the physiological data of the human body and transmit it to a remote cloud server for use by authorized users. However, how to retrieve and obtain the encrypted data has become a problem that must be solved. Nowadays, searchable encryption with keywords (SEK) is a widely used technology to solve this problem. Nevertheless, there are some problems that need to be noted. First, SEK is vulnerable to keyword guessing attack (KGA) and inside keyword guessing attack (IKGA). Second, since the sender and receiver are likely to work under different cryptosystems, the designed scheme should satisfy heterogeneity. Third, the communication parties in heterogeneous domain usually use different cryptographic system parameters, achieving cross-domain authentication between these communication parties can greatly improve the practicability of the scheme. To address these issues, we put forward a new searchable signcryption scheme for WBAN. Under the complexity of computational assumptions, the proposed scheme is proved to simultaneously achieve ciphertext indistinguishability, trapdoor indistinguishability, ciphertext unforgeability and the resistance of KGA and IKGA in the random oracle model (ROM). Further, our scheme allows the WBAN sensors in the certificateless public key cryptography (CLC) environment and the receivers in the public key infrastructure (PKI) environment to realize cross-domain authentication and heterogeneous communication. Compared to the five existing schemes, the total computation cost of our scheme is reduced by at least 59.99%.
Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper proposed a heterogeneous searchable encryption (SE) scheme that supports multi-keyword search and allows the sender and receiver to be worked in different cryptosystems.
Abstract: Searchable encryption (SE) technology allows users to use keywords to retrieve encrypted data and ensure that useful plaintext information about encrypted data will not be disclosed. For a secure SE scheme, if it is able to meet the multi-trapdoor privacy (MTP), the security will be improved compared with the traditional SE scheme. However, there are few searchable encryption schemes that can meet the requirements of MTP. In addition to the security of the SE scheme, we should also strive to improve its practicability. Nowadays, many existing SE schemes use a single keyword to generate the keyword ciphertext and trapdoor for retrieving ciphertext, which will greatly reduce the accuracy of the search result. Another phenomenon deserves our attention. In recent years, public key cryptosystems such as certificateless cryptography (CLC) and public key infrastructure (PKI) have been widely used. If a SE scheme satisfies heterogeneity means that both sides of communication parties do not need to restrict the use of the same cryptosystems, the practicability of this scheme will be improved. Therefore, we propose a heterogeneous SE scheme that provides MTP. The new scheme supports multi-keyword search and allows the sender and receiver to be worked in different cryptosystems. Furthermore, it would obviously be impractical to use the same cryptographic system parameters between heterogeneous systems, so the communication parties in our scheme operate in different cryptosystems with different cryptographic system parameters. With the use of the random oracle model (ROM), we demonstrate the security of the proposed scheme, and we show the excellent performance of the proposed scheme at the end of the article.
References
More filters
Posted Content
TL;DR: Boneh et al. as mentioned in this paper proposed a public key encryption with keyword search (PEKS) scheme, which enables Alice to provide a key to the gateway that enables the gateway to test whether the word "urgent" is a keyword in the email without learning anything else about the email.
Abstract: We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice’s public key. An email gateway wants to test whether the email contains the keyword “urgent” so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to test whether the word “urgent” is a keyword in the email without learning anything else about the email. We refer to this mechanism as Public Key Encryption with keyword Search. As another example, consider a mail server that stores various messages publicly encrypted for Alice by others. Using our mechanism Alice can send the mail server a key that will enable the server to identify all messages containing some specific keyword, but learn nothing else. We define the concept of public key encryption with keyword search and give several constructions.

155 citations

Proceedings ArticleDOI
24 Mar 2009
TL;DR: This paper presents Zerber+R -- a ranking model which allows for privacy-preserving top-k retrieval from an outsourced inverted index and proposes a relevance score transformation function which makes relevance scores of different terms indistinguishable, such that even if stored on an untrusted server they do not reveal information about the indexed data.
Abstract: Privacy-preserving document exchange among collaboration groups in an enterprise as well as across enterprises requires techniques for sharing and search of access-controlled information through largely untrusted servers. In these settings search systems need to provide confidentiality guarantees for shared information while offering IR properties comparable to the ordinary search engines. Top-k is a standard IR technique which enables fast query execution on very large indexes and makes systems highly scalable. However, indexing access-controlled information for top-k retrieval is a challenging task due to the sensitivity of the term statistics used for ranking.In this paper we present Zerber+R -- a ranking model which allows for privacy-preserving top-k retrieval from an outsourced inverted index. We propose a relevance score transformation function which makes relevance scores of different terms indistinguishable, such that even if stored on an untrusted server they do not reveal information about the indexed data. Experiments on two real-world data sets show that Zerber+R makes economical usage of bandwidth and offers retrieval properties comparable with an ordinary inverted index.

148 citations


"Algorithm for Multi Keyword Search ..." refers methods in this paper

  • ...The solution uses RSA to overcome limitations [20,21,22] of key exchange, AES, to efficiently encrypt a large quantity of data, which is a necessity for cloud storage and SHA-3 hashing to ensure data integrity [23,234,25]....

    [...]

Posted Content
TL;DR: In this article, the authors consider the following problem: a user U wants to store his files in an encrypted form on a remote file server S, and later the user wants to efficiently retrieve some of the encrypted files containing (or indexed by) specific keywords, keeping the keywords themselves secret and not jeopardizing the security of the remotely stored files.
Abstract: We consider the following problem: a user U wants to store his files in an encrypted form on a remote file server S. Later the user U wants to efficiently retrieve some of the encrypted files containing (or indexed by) specific keywords, keeping the keywords themselves secret and not jeopardizing the security of the remotely stored files. For example, a user may want to store old e-mail messages encrypted on a server managed by Yahoo or another large vendor, and later retrieve certain messages while travelling with a mobile device. In this paper, we offer solutions for this problem under well-defined security requirements. Our schemes are efficient in the sense that no public-key cryptosystem is involved. Indeed, our approach is independent of the encryption method chosen for the remote files. They are also incremental, in that U can submit new files which are totally secure against previous queries but still searchable against future queries.

82 citations

Proceedings ArticleDOI
28 Jun 2013
TL;DR: This work proposes an efficient privacy-preserving search method over encrypted cloud data that utilizes minhash functions that is proved to satisfy adaptive semantic security definition and combines an effective ranking capability that is based on term frequency-inverse document frequency values of keyword document pairs.
Abstract: Cloud computing technologies become more and more popular every year, as many organizations tend to outsource their data utilizing robust and fast services of clouds while lowering the cost of hardware ownership. Although its benefits are welcomed, privacy is still a remaining concern that needs to be addressed. We propose an efficient privacy-preserving search method over encrypted cloud data that utilizes minhash functions. Most of the work in literature can only support a single feature search in queries which reduces the effectiveness. One of the main advantages of our proposed method is the capability of multi-keyword search in a single query. The proposed method is proved to satisfy adaptive semantic security definition. We also combine an effective ranking capability that is based on term frequency-inverse document frequency (tf-idf) values of keyword document pairs. Our analysis demonstrates that the proposed scheme is proved to be privacy-preserving, efficient and effective.

80 citations

Proceedings ArticleDOI
Wei Zhang1, Sheng Xiao1, Yaping Lin1, Ting Zhou1, Siwang Zhou1 
23 Jun 2014
TL;DR: To enable cloud servers to perform secure search without knowing the actual data of both keywords and trapdoors, a novel secure search protocol is systematically constructed and a novel Additive Order and Privacy Preserving Function family is proposed.
Abstract: With the advent of cloud computing, it becomes increasingly popular for data owners to outsource their data to public cloud servers while allowing data users to retrieve these data. For privacy concerns, secure searches over encrypted cloud data motivated several researches under the single owner model. However, most cloud servers in practice do not just serve one owner, instead, they support multiple owners to share the benefits brought by cloud servers. In this paper, we propose schemes to deal with secure ranked multi-keyword search in a multi-owner model. To enable cloud servers to perform secure search without knowing the actual data of both keywords and trapdoors, we systematically construct a novel secure search protocol. To rank the search results and preserve the privacy of relevance scores between keywords and files, we propose a novel Additive Order and Privacy Preserving Function family. Extensive experiments on real-world datasets confirm the efficacy and efficiency of our proposed schemes.

70 citations


"Algorithm for Multi Keyword Search ..." refers methods in this paper

  • ...The solution uses RSA to overcome limitations [20,21,22] of key exchange, AES, to efficiently encrypt a large quantity of data, which is a necessity for cloud storage and SHA-3 hashing to ensure data integrity [23,234,25]....

    [...]