Searchable encryption approaches: attacks and challenges

Kumar, Deepak; Thilagam, P. Santhi

doi:10.1007/s10115-018-1309-4

Cited by 8 publications

(7 citation statements)

References 63 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A frequency analysis attack is one of the known ciphertext attacks. It is built on studying the frequency of letters or collections of letters in a ciphertext [24]. Hence, it takes advantage of the frequency of encrypted data uploaded to 𝑆𝐼, which is either term frequency 𝑇𝐹 or term frequencyinverse 𝑇𝐹_𝐼𝐷𝐹.…”

Section: ▪ Frequency Analysis Attackmentioning

confidence: 99%

“…The 𝐶𝑆 can then compute the probability of appearance of any two of these keywords in any document by observing the number of the same documents reverted for those corresponding trapdoors. By continuing the search and leaking the access pattern, thereby obtaining more probabilities, the server will be able to access the keywords that correspond to the trapdoors [24]. After a modest clarification of this attack, we can say that our scheme resists the IKK attack because the search result by the CS is encrypted, and the access pattern does not leak any important information.…”

mentioning

confidence: 92%

See 1 more Smart Citation

Locality Improvement Scheme Based on QR Code Technique within Inverted Index

Alyousif,

Yassin

2023

IJCAI

View full text Add to dashboard Cite

Searchable symmetric encryption is one of the most important modern technologies that allow the owner to store private data on an unreliable server and search for the data securely while preserving the data's confidentiality and privacy. This field has several schemes, but these schemes suffered from slower data retrieval in the case of large database sizes owing to the poor locality. Hence, the server visits several memory locations for a single query. Other studies focused on improving the locality, but the result is either increased storage capacity or decreased efficiency of data reading. In the present study, we present a secure, searchable scheme that overcomes the abovementioned issues and works to improve the locality by exploiting the QR code technique and the Advanced Encryption Standard algorithm. Furthermore, our work maintains read efficiency, helps reduce the risk of data breaches, and protects sensitive information from being accessed by unauthorized individuals. Moreover, the proposed scheme can resist cyber security attacks, such as frequency analysis attacks and keyword guessing attacks. Additionally, we used real-world data in our experiments and demonstrated that our proposed scheme is secure and practically efficient and holds high accuracy.Povzetek: Predstavljana je varnostna iskalna shema za izboljšanje šifriranja, ki izboljšuje lokalnost, ohranja učinkovitost branja in je odporna na kibernetske napade.

show abstract

Section: ▪ Frequency Analysis Attackmentioning

confidence: 99%

mentioning

confidence: 92%

Locality Improvement Scheme Based on QR Code Technique within Inverted Index

Alyousif,

Yassin

2023

IJCAI

View full text Add to dashboard Cite

show abstract

“…(b) Frequency Analysis Attack: This attack aims to deduce the plaintext index keyword from the encrypted TF values of the encrypted index [11,7]. It is based on the premise that the distribution details of plaintext TF values and the corresponding encrypted TF values will be the same for some specific keywords.…”

Section: Preliminariesmentioning

confidence: 99%

Preserving Privacy of Co-occurring Keywords over Encrypted Data

Kumar

Thilagam

2021

Data and Applications Security and Privacy XXXV

View full text Add to dashboard Cite

The indexes of ranked searchable encryption contain encrypted keywords and their encrypted relevance scores. The encryption scheme of relevance scores must preserve the plaintext order after encryption so as to enable the cloud server to determine ranks of the documents directly from the encrypted keywords' scores for a given trapdoor. Existing schemes such as Order Preserving Encryption (OPE) and One-to-Many OPE preserve the plaintext order. However, they leak the distribution information, i.e., the frequency of ciphertext values, due to the insufficient randomness employed in these schemes. The cloud server uses frequency analysis attack to infer plaintext keywords of the indexes based on the frequency leakage. In this paper, an Enhanced One-to-Many OPE scheme is proposed to minimize the frequency leakage. The proposed scheme reduces not only the frequency leakage of individual keywords but also the co-occurring keywords of the phrases like "computer network", and "communication network".

show abstract

“…This scheme guarantees user to store the data on cloud after encryption and also makes easy to search operations on encrypted data. D. V. N. Siva Kumar [13] presented a brief review on all existing searchable encryption with respect to accuracy and security and also provided few remedial solutions for current existing problems like searching for a file in encrypted database which is present on cloud. Zuojie Deng et.al [14] proposed multiuser searchable encryption where users will encrypt the files before sending to cloud and also allows other users, who are authorized by cloud data owners to perform search operations on these files.…”

Section: Related Workmentioning

confidence: 99%

Implementation of User Centric SSE for Privacy-Preserving and Enhancing Searching Efficiency in Cloud Environment

Patil¹,

Goudar²

2019

IJITEE

View full text Add to dashboard Cite

Cloud computing allows the users geographically located to access data and application from a cloud which follows the pay-as-you-go financial model. This technology provides a method to enhance the capabilities dynamically without having to spend in new infrastructure or training personnel. Cloud computing promises to offer reliable services to the customer through the construction of next-generation data centers and storage technology. With its wide advantages, cloud computing has emerged as fast emergent segments of the IT. Hence data security is a major concern for cloud users. One solution to this is that user can apply encryption techniques on data before sending it to the cloud server. But encrypted data limits the server’s capability to make plaintext keyword search. Keyword search functionality that can function over the encrypted data is desirable but no information about the searched keyword or the retrieved document should not compromise in this process. Our implementation of searchable symmetric encryption proves that it is not vulnerable to such things and preserves privacy of user data and query.

show abstract

Searchable encryption approaches: attacks and challenges

Cited by 8 publications

References 63 publications

Locality Improvement Scheme Based on QR Code Technique within Inverted Index

Locality Improvement Scheme Based on QR Code Technique within Inverted Index

Preserving Privacy of Co-occurring Keywords over Encrypted Data

Implementation of User Centric SSE for Privacy-Preserving and Enhancing Searching Efficiency in Cloud Environment

Contact Info

Product

Resources

About