通信学报 ›› 2015, Vol. 36 ›› Issue (12): 163-171.doi: 10.11959/j.issn.1000-436x.2015325

• 隐私保护 • 上一篇    下一篇

机会网络中用户属性隐私安全的高效协作者资料匹配协议

李永凯1,2,刘树波1,2,杨召唤1,2,刘梦君1,2   

  1. 1 武汉大学 计算机学院,湖北 武汉 430072
    2 空天信息安全与可信计算教育部重点实验室,湖北 武汉 430072
  • 出版日期:2015-12-25 发布日期:2017-07-17
  • 基金资助:
    国家重点基础研究发展计划(“973”计划)基金资助项目;国家自然科学基金资助项目

Efficient and privacy-preserving profile matching protocols in opportunistic networks

Yong-kai LI1,2,Shu-bo LIU1,2,Zhao-huan YANG1,2,Meng-jun LIU1,2   

  1. 1 School of Computer,Wuhan University,Wuhan 430072,China
    2 Key Laboratory of Aerospace Information Security and Trusted Computing,Ministry of Education,Wuhan 430072,China
  • Online:2015-12-25 Published:2017-07-17
  • Supported by:
    The National Basic Research Program of China(973 Program);The National Natural Science Foundation of China

摘要:

在机会网络中,用户通过移动造成的相遇性机会,借助协作者实现消息的传输与内容的共享。为了克服现有协作者匹配协议加解密效率不高的问题,针对机会网络中用户的不同隐私要求,设计了3个不依赖同态加密的高效隐私内积计算协议,可以证明所提出的协议是隐私安全并且正确的。在此基础上,对所提出的3个协议的计算开销与通信开销,与现有工作进行了理论上的比较。仿真结果表明,所提协议能够高效地完成隐私安全匹配,其加解密时间要比基于Paillier加密体系的协议要少至少一个数量级。

关键词: 机会网络, 协作者匹配, 隐私安全协议, 资料匹配

Abstract:

In opportunistic networks,users can take the advantage of parallel opportunistic contacts with other mobile users and find the appropriate helpers to forward the messages or share the contents.Most of the existing profile-matching protocols were designed on the basis of homomorphic cryptosystem and were not quite efficient in encryption and decryption.Three efficient and privacy-preserving profile matching protocols were proposed to deal with different privacy requirements in opportunistic networks,which do not use any homomorphic encryption.The proposed protocols were proved to be privacy-preserving and correct.The performances of the protocols are thoroughly analyzed and evaluated via real smartphone experiments,and the results show that the proposed protocols can decrease encryption and decryption time by at least an order of magnitude than the Paillier cryptosystem based protocol.

Key words: opportunistic network, help-node finding, privacy-preserving protocol, profile matching

[1] 金家德. PTN力助运营商IP RAN建设步伐[J]. 电信科学, 2009, 25(11): 104 -105 .
[2] 张令文,谈振辉. 基于泰勒级数展开的蜂窝TDOA定位新算法[J]. 通信学报, 2007, 28(6): 2 -11 .
[3] 江金光,李天望. 低电压环形振荡器设计[J]. 通信学报, 2007, 28(6): 10 -65 .
[4] 赵贤敬,郑宝玉,钱小聪,傅洪亮. 协作发射分集系统及其误码性能分析[J]. 通信学报, 2007, 28(1): 7 -48 .
[5] 赵 娟,郭 平,邓宏钟,吴 俊,谭跃进,张 敏. 用户行为统计特性对通信网络性能可靠性的影响[J]. 通信学报, 2013, 34(1): 5 -50 .
[6] 葛方斌,张 涛,宋金玉,赵 敏,陈维华. 3n?1级混洗交换网络的重排性研究[J]. 通信学报, 2011, 32(10): 2 -18 .
[7] 刘 婷1,周 杰1,2,菊池久和2. 基于ISL0算法的码间干扰稀疏多径信道估计[J]. 通信学报, 2014, 35(5): 17 -133 .
[8] 史敏锐. 移动通信网承载物联网业务的研究[J]. 电信科学, 2010, 26(4): 12 -15 .
[9] 邱红飞. 存储的自动精简配置技术应用研究[J]. 电信科学, 2010, 26(11): 12 -17 .
[10] 孙彦东,季振洲,王晖. 卫星网络环境下的拥塞控制研究[J]. 电信科学, 2010, 26(11): 66 -72 .