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

doi:10.11959/j.issn.1000-436x.2015325

摘要/Abstract

摘要：

在机会网络中，用户通过移动造成的相遇性机会，借助协作者实现消息的传输与内容的共享。为了克服现有协作者匹配协议加解密效率不高的问题，针对机会网络中用户的不同隐私要求，设计了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

李永凯,刘树波,杨召唤,刘梦君. 机会网络中用户属性隐私安全的高效协作者资料匹配协议[J]. 通信学报, 2015, 36(12): 163-171.

Yong-kai LI,Shu-bo LIU,Zhao-huan YANG,Meng-jun LIU. Efficient and privacy-preserving profile matching protocols in opportunistic networks[J]. Journal on Communications, 2015, 36(12): 163-171.

图/表 4

图1

表1

表2

开销对比"

协议名称	隐私保护级别	计算开销	通信开销
Level-1隐私匹配协议	Level-1	(3d+1)mul	(d+1)(d+2l+λ+1)+2l
Level-2隐私匹配协议	Level-2	(2d+1)mul	$(d + 1) (⌊ lb (d + 1) ⌋ + 2 l + λ + 1) + 2 l$
Level-3隐私匹配协议	Level-3	(2d+4)mul	$(d + 1) (⌊ lb (d + 1) ⌋ + 2 l + λ + κ + 1) + 4 l + 2 κ + 2 ⌊ lb (d + 1) ⌋$
协议2^[12]	Level-2	(2d+4)exp+(2d+1)mul	≈(2d+3)l
PPSPC^[15]	Level-2	(2d+1)mul	$(d + 1) (⌊ lb (d + 1) ⌋ + 2 l + λ + 1) + 2 l$

表2

图2

参考文献 21

[1]	CONTI M , KUMAR M . Opportunities in opportunistic computing[J]. Computer, 2010,43(1): 42-50.
[2]	SHARMA G , MAZUMDAR R , SHROFF N B . Delay and capacity trade-offs in mobile ad hoc networks:a global perspective[J]. IEEE/ACM Transactions on Networking (ToN), 2007,15(5): 981-992.
[3]	陈曦, 李光松, 田有亮 ,等. 机会网络中基于社会属性的按需密钥管理方案[J]. 通信学报, 2013,34(12): 93-99. CHEN X , LI G S , TIAN Y L ,et al. On-demand key management based on social attribute for opportunistic networks[J]. Journal on Communications, 2013,34(12): 93-99.
[4]	CONTI M , GIORDANO S , MAY M ,et al. From opportunistic networks to opportunistic computing[J]. Communications Magazine,IEEE, 2010,48(9): 126-139.
[5]	CONTI M , DAS S K , BISDIKIAN C ,et al. Looking ahead in pervasive computing:challenges and opportunities in the era of cyber-physical convergence[J]. Pervasive and Mobile Commputing, 2012,8(1): 2-21.
[6]	胡海洋, 李忠金, 胡华 ,等. 面向移动社交网络的协作式内容分发机制[J]. 计算机学报, 2013,36(3): 613-625. HU H Y , LI Z J , HU H ,et al. Cooperative contents distribution in mobile social networks[J]. Chinese Journal of Computers, 2013,36(3): 613-625.
[7]	LU R , LIN X , LIANG X ,et al. A secure handshake scheme with symptoms-matching for mhealthcare social network[J]. Mobile Networks and Applications, 2011,16(6): 683-694.
[8]	KAPADIA A , KOTZ D , TRIANDOPOULOS N . Opportunistic sensing:security challenges for the new paradigm[A]. First International in Communication Systems and Networks and Workshops[C]. Bangalore,India, 2009. 1-10.
[9]	熊永平, 孙利民, 牛建伟 ,等. 机会网络[J]. 软件学报, 2009,20(1): 124-137. XIONG Y P , SUN L M , NIU J W ,et al. Opportunistic networks[J]. Journal of Software, 2009,20(1): 124-137.
[10]	徐佳, 孙力娟, 王汝传 ,等. 机会网络中基于种子喷雾的自适应路由协议[J]. 电子学报, 2010,38(10): 2315-2321. XU J , SUN L J , WANG R C ,et al. Adaptive seed spay routing for opportunistic networks[J]. Acta Electronic Sinica, 2010,38(10): 2315-2321.
[11]	WANG X , CHENG W , MOHAPATRA P ,et al. Enabling reputation and trust in privacy-preserving mobile sensing[J]. IEEE Transactions on Mobile Computing, 2014,13(12): 2777-2790.
[12]	ZHANG R , ZHANG J , ZHANG Y ,et al. Privacy-preserving profile matching for proximity-based mobile social networking[J]. IEEE Journal on Selected Areas in Communications, 2013,31(9): 656-668.
[13]	LI M , CAO N , YU S ,et al. FindU:privacy-preserving personal profile matching in mobile social networks[A]. INFOCOM[C]. Shanghai,China, 2011. 2435-2443.
[14]	FREEDMAN M J , NISSIM K , PINKAS B . Efficient private matching and set intersection[A]. Cryptology-EUROCRYPT 2004[C]. Interlaken,Switzerland, 2004. 1-19.
[15]	DONG C , CHEN L . A Fast Secure Dot Product Protocol with Application to Privacy Preserving Association Rule Mining[M]. Knowledge Discovery and Data Mining,Springer International Publishing, 2014.
[16]	ZHU X , CHEN Z , CHI H ,et al. Two-party and multi-party private matching for proximity-based mobile social networks[A]. IEEE International Conference on Communications (ICC)[C]. Sydney,Australia, 2014. 926-931.
[17]	LU R , LIN X , SHEN X . SPOC:a secure and privacy-preserving opportunistic computing framework for mobile-healthcare emergency[J]. IEEE Transactions on Parallel and Distributed Systems, 2013,24(3): 614-624.
[18]	LIAO X , ULUAGAC S , BEYAH R A . S-match:verifiable privacy-preserving profile matching for mobile social services[A]. The 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)[C]. Atlanta,USA, 2014. 287-298.
[19]	HUANG K H , CHUNG Y F , LIU C H ,et al. Efficient migration for mobile computing in distributed networks[J]. Computer Standards ＆Interfaces, 2009,31(1): 40-47.
[20]	LU R , LIN X , SHI Z ,et al. PLAM:a privacy-preserving framework for local-area mobile social networks[A]. INFOCOM[C]. Toronto,Canada, 2014. 763-771.
[21]	KAYASTHA N , NIYATO D , WANG P ,et al. Applications,architectures,and protocol design issues for mobile social networks:a survey[J]. Proceedings of the IEEE, 2011,99(12): 2130-2158.

协议名称	属性数目暴露概率
协议名称	d=10	d=20		d=50	d=100
协议2^[12]	7.28×10^?158	7.11×10^?161		6.62×10^?170	5.88×10^?185
PPSPC 协议	9.77×10^?4	9.54×10^?7		8.88×10^?16	7.89×10^?31
Level1隐私匹配协议			＜1.00×10^?300
Level2隐私匹配协议			＜1.00×10^?300
Level3隐私匹配协议	4.96×10^?119	4.84×10^?122		4.50×10^?131	4.00×10^?146