密码学报2023，Vol.10Issue(6)：1183-1196,14.DOI:10.13868/j.cnki.jcr.000655
结构化加密图数据的Top-H跳节点查询
Top-H Query on Structured Encrypted Graph
摘要
Abstract
In order to protect the privacy of outsourced data,users usually need to encrypt the data and store them to a cloud server.After data encryption,it is difficult to query and process encrypted data.In 2010,Kamara et al.proposed the concept of structured encryption,which can realize efficient query of various types of data,including text,matrix,graph data,etc.Base on the idea of structured encryption,a top-H-hop node query method for structured encrypted graph data is proposed in this paper.The existing H-hop query schemes mainly calculate the number of hops between query nodes by 2-Hop index to judge the reachability between them.Once the number of nodes reaches 100,000 or millions,the computing and storage overheads of building 2-Hop index are very large.The scheme proposed in this paper greatly reduces the storage overhead while satisfying the reachability judgment,improves the query efficiency,and achieves richer H-hop range queries.The proposed scheme adopts the idea of"chainability"in structured encryption to achieve iterative querying of neighbor nodes.It queries the top-H-hop nodes that satisfy the conditions according to the user-specified hop number(H).The security analysis shows that this scheme satisfies CQA2-security.The experimental results on real datasets show that the proposed scheme is more efficient compared to some existing schemes.关键词
云计算/结构化加密/top-H查询/图加密Key words
cloud computing/structured encryption/top-H query/graph encryption分类
信息技术与安全科学引用本文复制引用
胡梦迪,陈兰香..结构化加密图数据的Top-H跳节点查询[J].密码学报,2023,10(6):1183-1196,14.基金项目
国家自然科学基金面上项目(62072105)General Program of National Natural Science Foundation of China(62072105) （62072105）
