Encrypted Data Search Research Articles

Verifiable and Searchable Symmetric Encryption Scheme Based on the Public Key Cryptosystem

With the rapid development of Internet of Things technology and cloud computing technology, all industries need to outsource massive data to third-party clouds for storage in order to reduce storage and computing costs. Verifiable and dynamic searchable symmetric encryption is a very important cloud security technology, which supports the dynamic update of private data and allows users to perform search operations on the cloud server and verify the legitimacy of the returned results. Therefore, how to realize the dynamic search of encrypted cloud data and the effective verification of the results returned by the cloud server is a key problem to be solved. To solve this problem, we propose a verifiable dynamic encryption scheme (v-PADSSE) based on the public key cryptosystem. In order to achieve efficient and correct data updating, the scheme designs verification information (VI) for each keyword and constructs a verification list (VL) to store it. When dynamic update operations are performed on the cloud data, it is easy to quickly update the security index through obtaining the latest verification information in the VL. The safety and performance evaluation of the v-PADSSE scheme proved that the scheme is safe and effective.

Leveraging Searchable Encryption through Homomorphic Encryption: A Comprehensive Analysis

The widespread adoption of cloud infrastructures has revolutionized data storage and access. However, it has also raised concerns regarding the privacy of sensitive data. To address these concerns, encryption techniques have been widely used. However, traditional encryption schemes limit the efficient search and retrieval of encrypted data. To tackle this challenge, innovative approaches have emerged, such as the utilization of Homomorphic Encryption (HE) in Searchable Encryption (SE) schemes. This paper provides a comprehensive analysis of the advancements in HE-based privacy-preserving techniques, focusing on their application in SE. The main contributions of this work include the identification and classification of existing SE schemes that utilize HE, a comprehensive analysis of the types of HE used in SE, an examination of how HE shapes the search process structure and enables additional functionalities, and the identification of promising directions for future research in HE-based SE. The findings reveal the increasing usage of HE in SE schemes, particularly Partially Homomorphic Encryption. The popularity of this type of HE schemes, especially Paillier’s cryptosystem, can be attributed to its simplicity, proven security properties, and widespread availability in open-source libraries. The analysis also highlights the prevalence of index-based SE schemes using HE, the support for ranked search and multi-keyword queries, and the need for further exploration in functionalities such as verifiability and the ability to authorize and revoke users. Future research directions include exploring the usage of other encryption schemes alongside HE, addressing omissions in functionalities like fuzzy keyword search, and leveraging recent advancements in Fully Homomorphic Encryption schemes.

Improving the Performance of Searchable Symmetric Encryption by Optimizing Locality

Both individuals and organizations prioritize data security and privacy, leading to an increasing focus on technological solutions that emphasize these aspects. Searchable symmetric encryption stands out as a prominent choice for secure storage and search of encrypted data on cloud servers, contributing to this objective. While searchable symmetric encryption offers numerous benefits, it also faces certain challenges, particularly when dealing with large databases. One significant challenge is poor performance, often attributed to poor locality. Visiting multiple locations can significantly increase the time required for data retrieval. Additionally, optimization methods aimed at improving locality can sometimes impact read efficiency or result in excessive storage of the encrypted index on the cloud server. In this paper, we present a scheme that effectively addresses these issues. We have enhanced the encrypted inverted index storage mechanism to improve information retrieval performance. Our scheme achieves optimal locality O(1) and optimal read efficiency in O(1), resulting in a significant increase in retrieval speed. Through experimentation with real-world data, we have demonstrated the practicality, accuracy, and security of our scheme.

Isoga: An Isogeny-Based Quantum-Resist Searchable Encryption Scheme Against Keyword Guessing Attacks

Driven by cloud computing technologies, public-key encryption with keyword search (PEKS) is becoming a common practice from aspects of the Industrial Internet of Things, smart healthcare, vehicular social networks, and so on. However, a dozen years of PEKS development is accompanied by some security and privacy issues in the encrypted data search and access processes. The keyword guessing attack is a typical user privacy threat model, that is, an adversary could guess the user’s retrieval keyword given a search trapdoor. On the other hand, the emergence of quantum computers make traditional PEKS schemes no longer secure. Although scholars put forward some postquantum secure PEKS schemes, these schemes are based on lattice cryptography with a larger key size. To the best of our knowledge, there is no quantum-resist PEKS scheme established on elliptic curve cryptography. This article utilizes PEKS with designated tester primitive and quantum resistance of isogeny. Then, we put forward a postquantum searchable encryption scheme named Isoga, which fights against keyword guessing attacks. We prove Isoga’s searchable ciphertext security and trapdoor indistinguishability under isogeny-related difficult assumptions. Performance evaluation indicates that the Isoga scheme is more practical in the quantum environment, considering seven schemes’ security properties, communication cost, and computing overload among.

Flexible and Efficient Multi-Keyword Ranked Searchable Attribute-Based Encryption Schemes

Currently, cloud computing has become increasingly popular and thus, many people and institutions choose to put their data into the cloud instead of local environments. Given the massive amount of data and the fidelity of cloud servers, adequate security protection and efficient retrieval mechanisms for stored data have become critical problems. Attribute-based encryption brings the ability of fine-grained access control and can achieve a direct encrypted data search while being combined with searchable encryption algorithms. However, most existing schemes only support single-keyword or provide no ranking searching results, which could be inflexible and inefficient in satisfying the real world’s actual needs. We propose a flexible multi-keyword ranked searchable attribute-based scheme using search trees to overcome the above-mentioned problems, allowing users to combine their fuzzy searching keywords with AND–OR logic gates. Moreover, our enhanced scheme not only improves its privacy protection but also goes a step further to apply a semantic search to boost the flexibility and the searching experience of users. With the proposed index-table method and the tree-based searching algorithm, we proved the efficiency and security of our schemes through a series of analyses and experiments.

Efficient Secure Privacy Preserving Multi Keywords Rank Search over Encrypted Data in Cloud Computing

Verifiable multi keywords rank searchable encryption is an important technique to retrieve encrypted data in a cloud server and verify the validity of search results. The cloud server is malicious it may return incorrect search results or system fault. Thus, how to design verifiable secure multi keywords ranked search of outsourced encrypted data is an unsolved problem. Therefore, in this paper, we leverage the (T-SNE) techniques to reduce dimensionality and feathers transformation. Then adopt similar keywords clustering groups grouping strategy to construct an enhanced inverted index. Which links to coordinate matching techniques to improve accurate multi-keyword rank searches for practical user experience. Then Paillier Homorphic Encryption (P.H.E) and HMAC technique is adopted for search index encryption and keyword search verification to explore verifiable multi keywords rank search over encrypted data in the cloud server. The time cost of ranking score computation and search efficiency can be improved in two approaches, keywords grouping idea and no dummy keywords are added in query and documents vector. Thus, our scheme realizes verifiable multi keywords search exact ciphertext retrieval. We evaluated the performance of our proposed scheme using real-world datasets that ensure adequate security and privacy.

Verifiable Keyword Search Encryption Scheme That Supports Revocation of Attributes

In recent years, searchable encryption technology and attribute encryption technology have been widely used in cloud storage environments, and attribute-based searchable encryption schemes can both achieve the retrieval of encrypted data and effectively solve the access control problem. Considering that existing attribute-based searchable encryption schemes for cloud storage only support keyword search and do not support attribute revocation, most of the schemes that support attribute revocation only consider the computational overhead of users and ignore the large amount of computational resources consumed by attribute authorization centers when updating keys. In addition, keyword search may lead to partial errors in the returned search results, leading to the wastage of computational and broadband resources. To solve these issues, this paper proposes an attribute-based searchable encryption scheme that supports attribute revocation and is verifiable. To realize fine-grained ciphertext search of encrypted data, support scenarios of dynamic changes of user attributes, and ensure that third-party servers perform the search process reliably and honestly while minimizing computation and storage costs, first, this paper implements attribute revocation with the attribute authorization center by creating a user revocation list and an attribute key revocation list. At the same time, the system updates the attribute key at the time of user search request, which effectively reduces the computational overhead. Second, a third-party auditor is introduced to ensure the correctness of the search results. Finally, the security of this paper is verified by theoretical analysis, and the efficiency and practicality of this paper are verified by comparing it to other schemes through simulation experiments.

A remote sensing encrypted data search method based on a novel double-chain

Remote sensing is considered to be a key technology for the development of smart cities. By analysing the data obtained by remote sensing, it is effective to manage and develop smart cities. However, with the rapid urbanisation and the increase in data capacity, how to store and retrieve remote sensing data which have more potential value and privacy with a more effective and safe method has become an imminent issue. In this paper, we propose an efficient verifiable and dynamic multi-keyword searchable encryption scheme for remote sensing data in smart cities. Moreover, we construct a double-chain index to support a multi-keyword search, where the Verification Index Chain is used to identify the users and the Keyword Index Chain is used to store the information of keywords. In addition, we adopt extended bitmap technology to realise update operations and verify the correctness and integrity of the search results. Experiments show that compared to the related existing schemes, the search time of the proposed scheme is reduced by 35% at most, the verification time is reduced by 14% at most and the update time is reduced by 57% at most.

A Public Key Searchable Encryption Method Based on Multiple Keywords

In recent years, the secure search of encrypted cloud data has become a hot research topic and a challenging task. Several secure search schemes have been proposed to address this challenge. However, existing public-key searchable encryption schemes still face many problems. Among these schemes, most of them are based on single-key searchable encryption schemes, and although some schemes are designed for multi-key search, they still disclose the secret information of the encrypted index. Based on this, this paper proposes a multi-key public-key searchable encryption scheme without a secure channel, which uses a random element padding method to construct an encrypted index to ensure the security of the index information, and then improves the efficiency of the search by aggregating the query keyword information to generate query trapdoors. The simulation results of the algorithm show that the algorithm improves the query efficiency and query accuracy under the condition that the index and trapdoor are secure.

A Novel Deterministic Threshold Proxy Re-Encryption Scheme From Lattices

Aiming at the problem that it is difficult to flexibly realize, the sharing and efficient search of encrypted data in large data-bases, this paper proposes a deterministic threshold proxy re-encryption scheme under the auxiliary input model. This scheme uses Shamir's secret sharing technology to achieve threshold control, uses homomorphic signature technology to verify the legitimacy of ciphertext, and applies deterministic algorithms to solve the search problem in large databases, while ensuring the user's control over their own data, and proves its security can reach indistinguishable semantic security (PRIV1-INDr) under the standard model. Compared with other schemes, this scheme not only shortens the length of the ciphertext and improves the decryption efficiency, but it also has anti-auxiliary input, robustness, and multi-hop characteristics and can better meet actual needs.

Cryptographic Accumulator and Its Application: A Survey

Since the concept of cryptographic accumulators was first proposed in 1993, it has received continuous attention from researchers. The application of the cryptographic accumulator is also more extensive. This paper makes a systematic summary of the cryptographic accumulator. Firstly, descriptions and characteristics of cryptographic accumulators are given, and the one-way accumulator, collision-free accumulator, dynamic accumulator, and universal accumulator are introduced, respectively. Cryptographic accumulator can be divided into two types: symmetric accumulator and asymmetric accumulator. In the asymmetric accumulator, three different cryptographic accumulator schemes were classified based on three security assumptions. Finally, this paper summarized the applications of cryptographic accumulators in ring signature, group signature, encrypted data search, anonymous credentials, and cryptographic promise.

Deniable search of encrypted cloud-storage data

Cloud storage services have grown extensively in recent years. For privacy and security purposes, outsourced data must be encrypted. Therefore, searching the encrypted cloud-stored data is a big challenge. Although there are plenty of searchable encryption schemes, most rely on keywords located in the encrypted data instead of more complex searching criteria. Moreover, they do not consider the malicious coercer issue. In this paper, we propose a searchable encryption scheme that supports expressive keyword-matching conditions and provides deniable searchability to the user.

WITHDRAWN: Intelligent secure phrase search of encrypted data in cloud based IoT

Abstract Phrase search enables relevant documents retrieval of an exact phrase in many cloud-based IoT machine learning applications to safeguard information from leakage. Here the documents are checked by the data proprietors before being exported to the cloud, rendering the search process a difficult job. Multi-keyword search evolving searchable encryption algorithms unable to establish the position association of phrases on the remote server in a parsed phrase over encrypted data. In this paper, an efficient privacy-preserving phrase search is introduced to protect users’ search patterns; a probabilistic phrase recognition algorithm is also used. The proposed work demonstrates the security of real-world datasets and compared with existing multi-keyword search schemes to show the better matched documents with moderate overheads.

Efficient Encrypted Data Search With Expressive Queries and Flexible Update

Outsourcing encrypted data to cloud servers that has become a prevalent trend among Internet users to date. There is a long list of advantages on data outsourcing, such as the reduction cost of local data management. How to securely operate encrypted data (remotely), however, is the top-rank concern over data owner. Liang <i>et al.</i> proposed a novel encrypted cloud-based data share and search system without loss of privacy. The system allows users to flexibly search and share encrypted data as well as updating keyword field. However, the search complexity of the system is of extreme inefficiency, <inline-formula><tex-math notation="LaTeX">$O(n d)$</tex-math></inline-formula> , where <inline-formula><tex-math notation="LaTeX">$d$</tex-math></inline-formula> is the total number of system files and <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula> is the size of query formula. This article, for the first time, leverages the “oblivious cross search” technology in public key searchable encryption context to reduce the search complexity to <i>only</i> <inline-formula><tex-math notation="LaTeX">$O(nf(w))$</tex-math></inline-formula> , where <inline-formula><tex-math notation="LaTeX">$f(w)$</tex-math></inline-formula> is the number of files embedded with the “least frequent keyword” <inline-formula><tex-math notation="LaTeX">$w$</tex-math></inline-formula> . The new scheme maintains efficient encrypted data share and keyword field update as well. This article further revisits the security models for payload security, keyword privacy and search token privacy (i.e., search pattern privacy) and meanwhile, presents security and efficiency analysis for the new scheme.

Multi-Authority Secure Database for Enabling Authorized Encrypted Search with Privacy Preserving on Healthcare Databases

Now a day’s in medical field number of application’s will develop for overcome the complexity of previous work. By using information technology and computer science provide various new techniques and medical equipment’s has improved digitalization in healthcare sector. In existing system much more advancement is providing to overcome the time and money of patients and perform exact treatments and store patient’s confidential records in securely but most important issues are security. To address the existing security issues to design and develop the proposed research work on security i.e. for patient’s confidential health data records in database servers. Existing work during data transmission can only protect the patient’s data records but they can’t stop the insider attacks. In proposed research work, first implement front end security with the help of keylogging technique, second to store patient’s confidential data in multiple data servers or chunks and to prevent the insider attacks and third and most important is access policy of search for encrypted data of multi-authority. The main contribution of this research work to assign patients data records in different chunks securely and applying the cryptosystems for security goals of a patient’s confidential records. Especially, proposed work advantages of SHA hashing technique to perform each and every user for access of particular data records. This research work explores secure data storage and sharing using proposed AES 128 encryption algorithm and Role Base Access Control (RBAC) for secure data access scheme for end user. This work also carried out backup server approach it works like proxy storage server for ad hoc data recovery for all distributed data servers.

User Specific Semantic Search for Encrypted Data

Cloud computing is the one of the service oriented applications which is used for the various users according to the requirements. Searching is the most widely used in many applications for the retrieving of the various data or documents according to the user keyword search. Accessing of cloud data which is encrypted is most widely used with the help of many encryption and decryption algorithms. In this paper, the user specific semantic search for the various encrypted data (USSSED) is introduced to overcome the issues in the previous systems. Results show the performance of the proposed system in terms of security and searching data.

Efficient top representative for multi-authorship encrypted cloud data to assist cognitive search

Cloud computing is gaining ground in the digital and business world. It delivers storage service for user access using Internet as a medium. Besides the numerous benefits of cloud services, migrating to public cloud storage leads to security and privacy concerns. Encryption method protects data privacy and confidentiality. However, encrypted data stored in cloud storage reduces the flexibility in processing data. Therefore, the development of new technologies to search top representatives from encrypted public storage is the current requirement. This paper presents a similarity-based keyword search for multi-author encrypted documents. The proposed Authorship Attribute-Based Ranked Keyword Search (AARKS) encrypts documents using user attributes, and returns ranked results to authorized users. The scheme assigns weight to index vectors by finding the dominant keywords of the specific authority document collection. Search using the proposed indexing prunes away branches and processes only fewer nodes. Re-weighting documents using the relevant feedback also improves user experience. The proposed scheme ensures the privacy and confidentiality of data supporting the cognitive search for encrypted cloud data. Experiments are performed using the Enron dataset and simulated using a set of queries. The precision obtained for the proposed ranked retrieval is 0.7262. Furthermore, information leakage to a cloud server is prevented, thereby proving its suitability for public storage.

An efficient certificateless public key encryption with equality test toward Internet of Vehicles

AbstractWith the rapid development of the Internet of Vehicles, a great amount of vehicles are connected to Internet of Vehicles environment. These vehicles can exchange data to each other and upload the data to a cloud server for backup. Since the data contains some sensitive information, it is necessary to encrypt the data before uploading to the cloud server. However, this method severely hampers the utilization of data because of the tremendous difficulty in the search for encrypted data. For addressing the above issue, we propose a novel certificateless public key encryption supporting the equality test on ciphertexts that are performed by the cloud server while revealing nothing about the corresponding plaintexts. Our scheme has proved to be secure in bilinear Diffie‐Hellman assumption under the model of random oracle. At the same time, both theoretical analysis and experimental evaluation indicate the security, efficiency, as well as effectiveness of the proposed scheme.

Efficient dynamic multi-keyword fuzzy search over encrypted cloud data

Multi-keyword search of encrypted cloud data has attracted extensive attention worldwide in the recent years due to the increasing concern for data security and privacy in Cloud Computing. Fault-tolerance is important for multi-keyword fuzzy search which can provide accurate results even with the presence of minor spelling and typographical errors in the search keywords. But, existing fuzzy search schemes lack efficiency due to their high computational overhead and do not support file dynamic updates. This paper proposes an efficient dynamic multi-keyword fuzzy search scheme for encrypted cloud data to support dynamic file updates. Locality sensitive hashing (LSH) and Bloom filters are employed to generate index vectors and query vectors. Based on the generated vectors, a balanced binary tree is constructed as the index for the entire file set, and a Top-k search algorithm is developed to search k files that are most relevant to a given query with the help of the index tree. Extensive experiments conducted on real-world datasets demonstrate that our scheme is more efficient than existing similar schemes.

A Light Weight Cryptographic Technique for Secure Outsourcing and Retrieval of Data in Cloud Computing

Outsourcing large volumes of data to public cloud has the potential benefits to consumers. It also brings security issues as the cloud is treated as untrusted from the user point of view. Security issues may arise due to many reasons such as virtualization, resource pooling, elasticity, hidden hardware problems besides internal and external attacks launched by adversaries. Service Level Agreements (SLAs) between Cloud Service Provider (CSP) and cloud consumer are to be honoured for better social welfare. Therefore, it is indispensable to have mechanisms to ensure security to outsourced data when it is at rest and when it is in transit as well. Towards this end, many solutions came as found in the literature. However, most of the cryptographic methods employed were expensive. It is still an open challenge to develop light weight cryptographic methods for secure storage and retrieval or search for outsourced encrypted data. In this paper we proposed a methodology for light weight encryption which proved to be effective and suitable for cloud computing environments. An algorithm named Hybrid Lightweight Data Encryption (HLDE) is proposed and implemented. Empirical study is made on the same to validate our approach. The experimental results revealed that the proposed method is better than the state of the art in terms of high performance and strong security to outsourced data in cloud computing.