计算机科学
关键词密度
情报检索
大方坯过滤器
关键字搜索
排名(信息检索)
加密
数据挖掘
聚类分析
树(集合论)
集合(抽象数据类型)
倒排索引
搜索引擎索引
数据库
计算机网络
人工智能
数学分析
数学
程序设计语言
作者
Jinlu Liu,Bo Zhao,Jing Qin,Xi Zhang,Jixin Ma
标识
DOI:10.1093/comjnl/bxab153
摘要
Abstract Multi-keyword ranked searchable encryption (MRSE) supports multi-keyword contained in one query and returns the top-k search results related to the query keyword set. It realized effective search on encrypted data. Most previous works about MRSE can only make the complete keyword search and rank on the server-side. However, with more practice, users may not be able to express some keywords completely when searching. Server-side ranking increases the possibilities of the server inferring some keywords queried, leading to the leakage of the user’s sensitive information. In this paper, we propose a new MRSE system named ‘multi-keyword ranked searchable encryption with the wildcard keyword (MRSW)’. It allows the query keyword set to contain a wildcard keyword by using Bloom filter (BF). Using hierarchical clustering algorithm, a clustering Bloom filter tree (CBF-Tree) is constructed, which improves the efficiency of wildcard search. By constructing a modified inverted index (MII) table on the basis of the term frequency-inverse document frequency (TF-IDF) rule, the ranking function of MRSW is performed by the user. MRSW is proved secure under adaptive chosen-keyword attack (CKA2) model, and experiments on a real data set from the web of science indicate that MRSW is efficient and practical.
科研通智能强力驱动
Strongly Powered by AbleSci AI