[1]刘轩甫,刘玉梅.社会机会网络中基于局部敏感哈希的用户隐私保护方案[J].应用科技,2019,46(03):93-99.[doi:10.11991/yykj.201810001]
 LIU Xuanfu,LIU Yumei.User privacy protection scheme based on locally sensitive Hash in social opportunity network[J].Applied science and technology,2019,46(03):93-99.[doi:10.11991/yykj.201810001]
点击复制

社会机会网络中基于局部敏感哈希的用户隐私保护方案(/HTML)
分享到:

《应用科技》[ISSN:1009-671X/CN:23-1191/U]

卷:
第46卷
期数:
2019年03期
页码:
93-99
栏目:
计算机技术与应用
出版日期:
2019-04-29

文章信息/Info

Title:
User privacy protection scheme based on locally sensitive Hash in social opportunity network
作者:
刘轩甫 刘玉梅
哈尔滨工程大学 信息与通信工程学院, 黑龙江 哈尔滨 150001
Author(s):
LIU Xuanfu LIU Yumei
College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
关键词:
隐私信息局部敏感哈希相似度隐私保护字典攻击路由协议网络性能机会网络
Keywords:
privacy informationlocally sensitive Hashsimilarityprivacy protectiondictionary attackrouting protocolnetwork performanceopportunity network
分类号:
TP393
DOI:
10.11991/yykj.201810001
文献标志码:
A
摘要:
针对社会机会网络中,基于节点社会关系信息作出决策的路由容易造成用户隐私信息暴露的问题,利用局部敏感哈希算法可对数据加密修改,并且加密后的数据仍可以进行统计分析的特性,分析任意2节点背景信息相似性,解决了单一哈希加密运算极容易遭受字典攻击等逆向恶意攻击,及机会网络中无法建立传统意义上公钥加密体系的问题。设计了在simhash算法基础上的社会机会网络中用户隐私保护方案,该方案通过计算用户隐私的指纹签名信息的相似度,获得原始信息的相似度,并在SASSY数据集下进行仿真验证。仿真结果表明,所提出方案有效地保护社会机会网络中用户隐私的背景信息,同时可以向网络提供节点辅助信息。虽然一定程度模糊了原始信息,但也可以保持路由正常性能。
Abstract:
Routing making decision based on information about node social relationship in the social opportunistic network would expose user’s private information, the Locality Sensitive Hashing can be used to conduct data encryption modification, and the encrypted data can still perform statistic analysis. So, the similarity of two nodes background information was analyzed on the basis of these characteristics, solving the problems that a single hash encryption operation is very vulnerable to reverse malicious attacks, for example, dictionary attacks, and that traditional public key encryption system cannot be established in opportunistic networks. A privacy protection scheme for users in social opportunity network was designed. The solution can obtain the similarity of the original information by calculating the similarity of the fingerprint signature of users, and simulation verification was carried out under SASSY dataset. The simulation result shows that the solution proposed in this paper can protect the background information about user’s privacy in social opportunistic network by making it non-identifiable. What’s more, it can provide node attribute parameters to the network. Although this makes the original information fuzzy to a certain extent, it can still protect the effective performance of the router.

参考文献/References:

[1] 马华东, 袁培燕, 赵东. 移动机会网络路由问题研究进展[J]. 软件学报, 2015, 26(3):600-616
[2] 姚玉坤, 张强, 杨及开. 基于社会组的高投递率机会网络路由协议[J]. 计算机应用研究, 2017, 34(2):577-581
[3] 刘慧, 张振宇, 杨文忠, 等. 机会网络中基于节点社会属性的转发算法[J]. 计算机工程与应用, 2017, 53(22):92-96
[4] 余翔, 刘志红, 闫冰冰. 基于社交关系的移动机会网络路由算法[J]. 计算机工程, 2017, 43(12):98-102
[5] WANG Peng, XU Baowen, WU Yurong, et al. Link prediction in social networks:the state-of-the-art[J]. Science China information sciences, 2015, 58(1):1-38.
[6] 孙立奋, 潘达儒. 一种基于兴趣挖掘的机会网络内容分发策略[J]. 华南师范大学学报(自然科学版), 2017, 49(5):108-114
[7] WU Zhenyu, ZOU Ming. An incremental community detection method for social tagging systems using locality-sensitive hashing[J]. Neural networks, 2014, 58:14-28.
[8] CHIERICHETTI F, KUMAR R, MAHDIAN M. The complexity of LSH feasibility[J]. Theoretical computer science, 2014, 530:89-101.
[9] LI Yang, SHA Ying, SHAN Jixi, et al. The research of weighted community partition based on SimHash[J]. Procedia computer science, 2013, 17:797-802.
[10] CHENG Gang, SONG Mei, ZHANG Yong, et al. Routing protocol based on social characteristics for opportunistic networks[J]. The journal of china universities of posts and telecommunications, 2014, 21(1):67-73, 103.
[11] 甄岩, 龚玲玲, 杨静, 等. 带有社会关系感知的机会网络组播路由机制[J]. 华中科技大学学报(自然科学版), 2016, 44(7):127-132
[12] 王志飞, 史培腾, 邓苏, 等. 基于节点社会特征的机会网络最优发送策略[J]. 通信学报, 2016, 37(6):163-168
[13] HUI Pan, CROWCROFT J, YONEKI E. Bubble rap:social-based forwarding in delay tolerant networks[C]//Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Hong Kong:ACM, 2008:241-250.
[14] DALY E M, HAAHR M. Social network analysis for routing in disconnected delay-tolerant MANETs[C]//Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Montreal, Quebec:ACM, 2007:32-40.
[15] LINDGREN A, DORIA A, SCHELÉN O. Probabilistic routing in intermittently connected networks[J]. ACM sigmobile mobile computing and communications review, 2004, 7(3):19-20.
[16] 张晓琳, 李玉峰, 王颖. 动态社会网络隐私保护方法研究[J]. 计算机应用研究, 2012, 29(4):1434-1437
[17] 陈先棒. 机会网络安全机制的设计与研究[D]. 南京:东南大学, 2016.
[18] PARRIS I, BIGWOOD G, HENDERSON T. Privacy-enhanced social network routing in opportunistic networks[C]//Proceedings of the 8th IEEE International Conference on Pervasive Computing and Communications Workshops. Mannheim, Germany:IEEE, 2012:624-629.
[19] 李德全, 张习勇, 张婷婷, 等. 具有私钥自愈能力的DTN密钥管理方案[J]. 网络与信息安全学报, 2017, 3(4):26-31
[20] TIMPNER J, SCHÜRMANN D, WOLF L. Trustworthy parking communities:helping your neighbor to find a space[J]. IEEE transactions on dependable and secure computing, 2016, 13(1):120-132.
[21] 陈曦, 马建峰. 基于身份加密的机会网络安全路由架构[J]. 计算机研究与发展, 2011, 48(8):1481-1487
[22] NGUYEN H A, GIORDANO S, PUIATTI A. Probabilistic routing protocol for intermittently connected mobile Ad hoc network (PROPICMAN)[C]//Proceedings of 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. Espoo, Finland:IEEE, 2007:1-6.
[23] BIGWOOD G, REHUNATHAN D, BATEMAN M, et al. Exploiting self-reported social networks for routing in ubiquitous computing environments[C]//Proceedings of 2018 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. Avignon, France:IEEE, 2008:484-489.
[24] PARRIS I, HENDERSON T. Privacy-enhanced social-network routing[J]. Computer communications, 2012, 35(1):62-74.
[25] DATAR M, IMMORLICA N, INDYK P, et al. Locality-sensitive hashing scheme based on p-stable distributions[C]//Proceedings of the Twentieth Annual Symposium on Computational Geometry. Brooklyn:ACM, 2004:253-262.

备注/Memo

备注/Memo:
收稿日期:2018-10-11。
作者简介:刘轩甫,男,硕士研究生;刘玉梅,女,副研究员,博士
通讯作者:刘轩甫,E-mail:646792976@qq.com
更新日期/Last Update: 2019-04-29