Semantic and secure search over encrypted outsourcing cloud based on BERT

2021 ◽  
Vol 16 (2) ◽  
Author(s):  
Zhangjie Fu ◽  
Yan Wang ◽  
Xingming Sun ◽  
Xiaosong Zhang
Keyword(s):  
2021 ◽  
Vol 21 (1) ◽  
pp. 1-17
Author(s):  
Zhitao Guan ◽  
Naiyu Wang ◽  
Xunfeng Fan ◽  
Xueyan Liu ◽  
Longfei Wu ◽  
...  
Keyword(s):  

Author(s):  
Fernando Krell ◽  
Gabriela Ciocarlie ◽  
Ashish Gehani ◽  
Mariana Raykova

2019 ◽  
pp. 657-677
Author(s):  
Shweta Annasaheb Shinde ◽  
Prabu Sevugan

This chapter improves the SE scheme to grasp these contest difficulties. In the development, prototypical, hierarchical clustering technique is intended to lead additional search semantics with a supplementary feature of making the scheme to deal with the claim for reckless cipher text search in big-scale surroundings, such situations where there is a huge amount of data. Least relevance of threshold is considered for clustering the cloud document with hierarchical approach, and it divides the clusters into sub-clusters until the last cluster is reached. This method may affect the linear computational complexity versus the exponential growth of group of documents. To authenticate the validity for search, minimum hash sub tree is also implemented. This chapter focuses on fetching of cloud data of a subcontracted encrypted information deprived of loss of idea and of security and privacy by transmission attribute key to the information. In the next level, the typical is improved with a multilevel conviction privacy preserving scheme.


Computing ◽  
2019 ◽  
Vol 102 (6) ◽  
pp. 1521-1545 ◽  
Author(s):  
Lanxiang Chen ◽  
Nan Zhang ◽  
Hung-Min Sun ◽  
Chin-Chen Chang ◽  
Shui Yu ◽  
...  

Author(s):  
Deepshikha Patel ◽  
Vasima Khan ◽  
Rajesh K Shukla ◽  
Monika Kherajani
Keyword(s):  

2019 ◽  
Vol 63 (8) ◽  
pp. 1203-1215 ◽  
Author(s):  
Yang Chen ◽  
Wenmin Li ◽  
Fei Gao ◽  
Kaitai Liang ◽  
Hua Zhang ◽  
...  

Abstract To date cloud computing may provide considerable storage and computational power for cloud-based applications to support cryptographic operations. Due to this benefit, attribute-based keyword search (ABKS) is able to be implemented in cloud context in order to protect the search privacy of data owner/user. ABKS is a cryptographic primitive that can provide secure search services for users but also realize fine-grained access control over data. However, there have been two potential problems that prevent the scalability of ABKS applications. First of all, most of the existing ABKS schemes suffer from the outside keyword guessing attack (KGA). Second, match privacy should be considered while supporting multi-keyword search. In this paper, we design an efficient method to combine the keyword search process in ABKS with inner product encryption and deploy several proposed techniques to ensure the flexibility of retrieval mode, the security and efficiency of our scheme. We later put forward an attribute-based conjunctive keyword search scheme against outside KGA to solve the aforementioned problems. We provide security notions for two types of adversaries and our construction is proved secure against chosen keyword attack and outside KGA. Finally, all-side simulation with real-world data set is implemented for the proposed scheme, and the results of the simulation show that our scheme achieves stronger security without yielding significant cost of storage and computation.


Sign in / Sign up

Export Citation Format

Share Document