Searchable encryption : A survey

Sharma, Dhruti

doi:10.1080/19393555.2022.2033367

Cited by 5 publications

(11 citation statements)

References 135 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each category, the available schemes were compared and evaluated. Sharma [9] provided a comprehensive guide on SE for non-security experts. The main goal of this work was to help general practitioners to select the most suitable SE scheme for their specific needs by presenting a survey that details the existing schemes based on five key characteristics: key structure, search structure, search functionality, support for readers/writers, and reader capability.…”

Section: Related Workmentioning

confidence: 99%

“…Noorallahzade et al [21] presented a more comprehensive categorization by considering additional aspects such as search type, index type, results type, security models, type of implementation, multiplicity of users, and cryptographic primitives. Sharma [9] detailed existing SE schemes based on five key characteristics: key structure, search structure, search functionality, support for readers/writers, and reader capability.…”

Section: Characterization Of a Se Schemementioning

confidence: 99%

“…PIR, closely related to secure search, enables users to retrieve specific data from a database without revealing which items they are accessing [8]. SE, on the other hand, is a cryptographic technique that allows for secure and efficient search operations over encrypted data [9]. It is important to note that the terms "secure search" and "searchable encryption" are sometimes used interchangeably, blurring the distinction between the two concepts.…”

Section: Introductionmentioning

confidence: 99%

“…Data owner (DO) The entity in charge of data encryption and its outsourcing to the cloud server is the data owner, also known as the "client" in relevant literature [9]. Generally, the data is produced by the DO who has legitimate control and ownership over it.…”

mentioning

confidence: 99%

“…The index is composed of words that are thought to be relevant to that document. This kind of index is appropriate for applications where it is necessary to upload a small number of documents to the CS [9]. • Inverted index.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Leveraging Searchable Encryption through Homomorphic Encryption: A Comprehensive Analysis

Amorim

Costa

2023

Mathematics

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Characterization Of a Se Schemementioning

confidence: 99%