Privacy-Preserving Closest Similar Community Search on Attributed Graphs

计算机科学 信息隐私 互联网隐私
作者
Fangyuan Sun,Jia Yu,Jiankun Hu
出处
期刊:IEEE Transactions on Information Forensics and Security [Institute of Electrical and Electronics Engineers]
卷期号:20: 6662-6677
标识
DOI:10.1109/tifs.2025.3583247
摘要

Community search on attributed graphs has gained significant attention in recent years for its ability to provide meaningful and personalized results. Given a query community, a similar community search aims to identify the communities that are similar in structural and attributed characteristics to the query community. As real-world networks continue to grow in complexity and size, outsourcing graph data and search tasks to cloud servers not only saves local storage space but also significantly enhances search efficiency. Nonetheless, this inevitably raises concerns about data privacy since cloud servers are not completely trustworthy. In this paper, we research on privacy-preserving similar community search on graphs. We propose a privacy-preserving closest similar community search scheme for attributed graphs that leverages cloud servers to enhance search efficiency while safeguarding the sensitive information in the graph. We consider packaging communities using center vertices to evaluate relationships across communities without accessing details within the communities. To achieve this, we design a centrality score function that integrates attribute contribution and closeness centrality to identify the center vertex of a community. To ensure the security of sensitive information in the attribute graph, we construct three secure indexes for the original graph utilizing diverse cryptographic primitives. By searching secure indexes, cloud servers can answer the closest similar community searches without possessing any sensitive information about the attribute graph. We employ Paillier homomorphic cryptosystem and related protocols to support efficient and secure evaluation of the distance and similarity between two communities on secure indexes. The security analysis confirms that the proposed scheme can be against adaptive chosen-query attacks so as to achieve CQA2-security and experimental results demonstrate the efficiency of the proposed scheme.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
yi完成签到,获得积分10
2秒前
无奈的哈密瓜完成签到 ,获得积分10
2秒前
3秒前
浅忆晨曦完成签到 ,获得积分10
4秒前
7秒前
刘恩瑜发布了新的文献求助10
8秒前
南瓜完成签到,获得积分10
8秒前
狂野的子骞关注了科研通微信公众号
8秒前
Kao应助ab采纳,获得10
10秒前
10秒前
萍乡斌乃完成签到,获得积分10
10秒前
水水发布了新的文献求助10
11秒前
华仔应助ne采纳,获得10
11秒前
12秒前
13秒前
molihuakai应助fionadong采纳,获得10
13秒前
充电宝应助wdg采纳,获得10
14秒前
keep发布了新的文献求助10
14秒前
123完成签到,获得积分10
18秒前
19秒前
Jasper应助songchaohui采纳,获得10
19秒前
无花果应助Sirius采纳,获得10
19秒前
斯文败类应助壮观的笑蓝采纳,获得10
19秒前
春衫发布了新的文献求助10
20秒前
22秒前
科研通AI2S应助Skyfury采纳,获得10
22秒前
22秒前
23秒前
25秒前
越凡发布了新的文献求助10
27秒前
orixero应助老杨采纳,获得10
27秒前
28秒前
干净芷蕾发布了新的文献求助10
29秒前
29秒前
29秒前
麻麻薯完成签到 ,获得积分10
29秒前
桐桐应助酚蓝8803采纳,获得10
29秒前
30秒前
哈尔行者完成签到,获得积分10
30秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Nondestructive Testing Handbook: Vol. 4, Thermal and Infrared Testing (IR), 4th ed 800
作者名:Kristopher P. Plain,悉尼大学的,目前只能查到其四篇论文,想找到其博士论文 590
Évora na Idade Média 555
Soil mites of the family Rhagidiidae (Actinedida: Eupodoidea). Morphology, Systematics, Ecology 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Radical Reactions 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7367337
求助须知:如何正确求助?哪些是违规求助? 8975402
关于积分的说明 19081773
捐赠科研通 7011113
什么是DOI,文献DOI怎么找? 3224527
关于科研通互助平台的介绍 2387902
邀请新用户注册赠送积分活动 2205060