检索结果-南通市图书馆

Dynamic multi-keyword fuzzy ranked search with leakage resilience over encrypted cloud data

The Journal of China Universities of Posts and Telecommunications 2023年第2期30卷 83-95页

作者： Zhou Yousheng Huang Miao Liu Yuanni Chen Zigang College of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing 400065China School of Cyber Security and Information Law Chongqing University of Posts and telecommunicationsChongqing 400065China

To achieve the confidentiality and retrievability of outsourced data simultaneously,a dynamic multi-keyword fuzzy ranked search scheme(DMFRS)with leakage resilience over encrypted cloud data based on two-level index structure was *** first level index adopts inverted index and orthogonal list,combined with 2-gram and location-sensitive Hashing(LSH)to realize a fuzzy *** second level index achieves user search permission decision and search result ranking by combining coordinate matching with term frequency-inverse document frequency(TF-IDF).A verification token is generated within the results to verify the search results,which prevents the potential malicious tampering by cloud service providers(CSP).The semantic security of DMFRS is proved by the defined leakage function,and the performance is evaluated based on simulation *** analysis results demonstrate that DMFRS gains certain advantages in security and performance against similar schemes,and it meets the needs of storage and privacy-preserving for outsourcing sensitive data.

关键词： secure search multi-keyword fuzzy rank dynamic privacy-preserving

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Efficient multi-keyword Query Processing Strategy on P2P Based Web Search

引用

Wuhan University Journal of Natural Sciences 2007年第5期12卷 881-886页

作者： SHEN Derong LI Meifang ZHU Hongkai YU Ge College of Information Science and Engineering Northeastem University Shenyang 110004China Department of New Froduct Research *** Inc. Beijing 100080 China

The paper presents a novel benefit based query processing strategy for efficient query routing. Based on DHT as the overlay network, it first applies Nash equilibrium to construct the optimal peer group based on the correlations of keywords and coverage and overlap of the peers to decrease the time cost, and then presents a two-layered architecture for query processing that utilizes Bloom filter as compact representation to reduce the bandwidth consumption. Extensive experiments conducted on a real world dataset have demonstrated that our approach obviously decreases the processing time, while improves the precision and recall as well.

关键词： multi-keyword P2P Web search correlation coverage and overlap Nash equilibrium

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Research on Fuzzy Matching Query Algorithm Based on Spatial multi-keyword

引用

国际计算机前沿大会会议论文集 2017年第1期 31-32页

作者： Suzhi Zhang Yanan Zhao Rui Yang School of Computer and Communication Engineering Zhengzhou University of Light IndustryZhengzhou 450002HenanChina

With the rapid growth of spatial data,POI(Point of Interest)is becoming ever more intensive,and the text description of each spatial point is also gradually *** traditional query method can only address the problem that the text description is less and single keyword *** view of this situation,the paper proposes an approximate matching algorithm to support spatial *** fuzzy matching algorithm is integrated into this algorithm,which not only supports multiple POI queries,but also supports fault tolerance of the query *** simulation results demonstrate that the proposed algorithm can improve the accuracy and efficiency of query.

关键词： Spatial data multi-keyword search Approximate query algorithm RB-tree

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Security Model for Preserving Privacy over Encrypted Cloud Computing

引用

Journal of Computer and Communications 2017年第6期5卷 149-165页

作者： Jassim R. Mlgheit Essam H. Houssein Hala H. Zayed Faculty of Computers and Informatics Benha University Benha Egypt Faculty of Computers and Information Minia University Minia Egypt

In our today’s life, it is obvious that cloud computing is one of the new and most important innovations in the field of information technology which constitutes the ground for speeding up the development in great size storage of data as well as the processing and distribution of data on the largest scale. In other words, the most important interests of any data owner nowadays are related to all of the security as well as the privacy of data, especially in the case of outsourcing private data on a cloud server publicly which has not been one of the well-trusted and reliable domains. With the aim of avoiding any leakage or disclosure of information, we will encrypt any information important or confidential prior to being uploaded to the server and this may lead to an obstacle which encounters any attempt to support any efficient keyword query to be and ranked with matching results on such encrypted data. Recent researches conducted in this area have focused on a single keyword query with no proper ranking scheme in hand. In this paper, we will propose a new model called Secure Model for Preserving Privacy Over Encrypted Cloud Computing (SPEC) to improve the performance of cloud computing and to safeguard privacy of data in comparison to the results of previous researches in regard to accuracy, privacy, security, key generation, storage capacity as well as trapdoor, index generation, index encryption, index update, and finally files retrieval depending on access frequency.

关键词： Cloud Computing multi-keyword Query Ranked Query Trapdoor Privacy Preserving Encrypted Cloud Data Top-K Query Cloud Security

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：