Blockchain Based Multi-keyword Similarity Search Scheme over Encrypted Data

2020 ◽  
pp. 350-371
Author(s):  
Mingyue Li ◽  
Chunfu Jia ◽  
Wei Shao
Keyword(s):  
Similarity Search ◽  
Encrypted Data

Secure, flexible and high-efficient similarity search over encrypted data in multiple clouds

2018 ◽  
Vol 12 (4) ◽  
pp. 893-911
Author(s):  
Jinguo Li ◽  
Mi Wen ◽  
Kui Wu ◽  
Kejie Lu ◽  
Fengyong Li ◽  
...  
Keyword(s):  
Similarity Search ◽  
Encrypted Data ◽  
High Efficient ◽  
Multiple Clouds

scholarly journals Secure Multi-keyword Similarity Search Over Encrypted Data With Security Improvement

2021 ◽  
Vol 17 (2) ◽  
pp. 1-10
Author(s):  
Hussein Mohammed ◽  
Ayad Abdulsada
Keyword(s):  
Real World ◽  
Similarity Search ◽  
Keyword Search ◽  
Bloom Filter ◽  
Locality Sensitive Hashing ◽  
Real World Data ◽  
Encrypted Data ◽  
Search Results ◽  
Security Properties ◽  
Cloud Servers

Searchable encryption (SE) is an interesting tool that enables clients to outsource their encrypted data into external cloud servers with unlimited storage and computing power and gives them the ability to search their data without decryption. The current solutions of SE support single-keyword search making them impractical in real-world scenarios. In this paper, we design and implement a multi-keyword similarity search scheme over encrypted data by using locality-sensitive hashing functions and Bloom filter. The proposed scheme can recover common spelling mistakes and enjoys enhanced security properties such as hiding the access and search patterns but with costly latency. To support similarity search, we utilize an efficient bi-gram-based method for keyword transformation. Such a method improves the search results accuracy. Our scheme employs two non-colluding servers to break the correlation between search queries and search results. Experiments using real-world data illustrate that our scheme is practically efficient, secure, and retains high accuracy.

Achieving Efficient and Privacy-Preserving Exact Set Similarity Search over Encrypted Data

2020 ◽  
pp. 1-1
Author(s):  
Yandong Zheng ◽  
Rongxing Lu ◽  
Yunguo Guan ◽  
Jun Shao ◽  
Hui Zhu
Keyword(s):  
Similarity Search ◽  
Privacy Preserving ◽  
Encrypted Data

Privacy preserving weighted similarity search scheme for encrypted data

2019 ◽  
Vol 13 (1) ◽  
pp. 61-69 ◽  
Author(s):  
Cheng Guo ◽  
Pengxu Tian ◽  
Chin-Chen Chang
Keyword(s):  
Similarity Search ◽  
Privacy Preserving ◽  
Encrypted Data

Efficient Multi-user Similarity Search Over Encrypted Data in Cloud Storage

2018 ◽  
Vol 107 (3) ◽  
pp. 1337-1353
Author(s):  
Changhee Hahn ◽  
Hyung June Shin ◽  
Hyunsoo Kwon ◽  
Junbeom Hur
Keyword(s):  
Similarity Search ◽  
Cloud Storage ◽  
Encrypted Data ◽  
User Similarity

scholarly journals Efficient multi-keyword similarity search over encrypted cloud documents

2021 ◽  
Vol 23 (1) ◽  
pp. 510
Author(s):  
Ayad I. Abdulsada ◽  
Dhafer G. Honi ◽  
Salah Al-Darraji
Keyword(s):  
Similarity Search ◽  
Keyword Search ◽  
Service Providers ◽  
Hamming Distance ◽  
Cloud Service ◽  
Sensitive Data ◽  
Encrypted Data ◽  
High Level ◽  
Do So ◽  
Similarity Scores

Many organizations and individuals are attracted to outsource their data into remote cloud service providers. To ensure privacy, sensitive data should be encrypted be-fore being hosted. However, encryption disables the direct application of the essential data management operations like searching and indexing. Searchable encryption is acryptographic tool that gives users the ability to search the encrypted data while being encrypted. However, the existing schemes either serve a single exact search that loss the ability to handle the misspelled keywords or multi-keyword search that generate very long trapdoors. In this paper, we address the problem of designing a practical multi-keyword similarity scheme that provides short trapdoors and returns the correct results according to their similarity scores. To do so, each document is translated intoa compressed trapdoor. Trapdoors are generated using key based hash functions to en-sure their privacy. Only authorized users can issue valid trapdoors. Similarity scores of two textual documents are evaluated by computing the Hamming distance between their corresponding trapdoors. A robust security definition is provided together withits proof. Our experimental results illustrate that the proposed scheme improves thesearch efficiency compared to the existing schemes. Further more, it shows a high level of performance.

scholarly journals Efficient Similarity Search over Encrypted Data

2012 ◽  
Author(s):  
Mehmet Kuzu ◽  
Mohammad Saiful Islam ◽  
Murat Kantarcioglu
Keyword(s):  
Similarity Search ◽  
Encrypted Data

Similarity Search in Data Stream with Adaptive Segmental Approximations

2009 ◽  
Vol 20 (10) ◽  
pp. 2867-2884 ◽  
Author(s):  
Feng WU ◽  
Yan ZHONG ◽  
Quan-Yuan WU ◽  
Yan JIA ◽  
Shu-Qiang YANG
Keyword(s):  
Similarity Search ◽  
Data Stream
Sign in / Sign up

Export Citation Format

Share Document