Network coding-based privacy protection scheme for mobile P2P networks

被引:0
作者
机构
[1] School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang , 212013, Jiangsu
[2] Information Center, Jiangsu University, Zhenjiang , 212013, Jiangsu
[3] Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing
来源
Li, Zhiyuan | 1600年 / Science Press卷 / 51期
关键词
Linear network coding; Mobile Internet; Mobile peer to peer technology; Mutual anonymity; User privacy;
D O I
10.7544/issn1000-1239.2014.20120948
中图分类号
学科分类号
摘要
With the rapid development of mobile peer to peer (MP2P) applications, user privacy requirements have become increasingly urgent. However, in distributed, frequent mobility and decentralized MP2P environments, the existing schemes have various security vulnerabilities. To protect user privacy in MP2P environments, a mutual anonymity node privacy protection scheme (NMA) based on network coding is proposed. Our contributions are described as below. We first design a network coding scheme which can defend against various omniscient adversary attacks. Then, the network coding is used in the MP2P file-sharing application, including the resource searching, the resource requesting, the resource responding and the file download, to protect user's identity, user's location and routing information. The advantages of the scheme lie in the fact that the network coding and mutli-agent can improve the network load balance, the successful rate of information transmission and the anonymity degree. Both theoretical analysis and the experimental results demonstrate that when the percentage of malicious peers is lower than 50%, the NMA scheme not only can protect the efficient information transmission, but also can hide the user's identity and other privacy information.
引用
收藏
页码:2318 / 2328
页数:10
相关论文
共 16 条
[1]  
Fang W., Ren J., Xia H., Heterogeneous distributed linear regression privacy-preserving modeling , Journal of Computer Research and Development, 48, 9, pp. 1685-1692, (2011)
[2]  
Yang Q., Alvin L., Ruan X.J., Et al., Location privacy protection in contention based forwarding for VANETs, Proc of the 53rd IEEE Global Communications Conf, pp. 1-5, (2010)
[3]  
Chow C.Y., Mokbel M.F., Liu X., Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments , GeoInformatica, 15, 2, pp. 351-380, (2011)
[4]  
Huo Z., Meng X., A survey of trajectory privacy-preserving techniques, Chinese Journal of Computers, 34, 10, pp. 1820-1830, (2011)
[5]  
Xiao R.Y., Survey on anonymity in unstructured peer-to-peer systems , Journal of Computer Science and Technology, 23, 4, pp. 660-671, (2008)
[6]  
Chaum D., Untraceable electronic return addresses, and digital pseudonyms , Communications of the ACM, 24, 2, pp. 84-90, (1981)
[7]  
Goldschlag D., Reed M., Syverson P., Onion routing , Communications of the ACM, 42, 2, pp. 39-41, (1999)
[8]  
Li X., Xu Z., Zhang X., Low-cost and reliable mutual anonymity protocols in peer-to-peer networks , IEEE Trans on Parallel and Distributed Systems, 14, 9, pp. 829-840, (2003)
[9]  
Sherwood R., Bhattacharjee B., Srinivasan A., P5: A protocol for scalable anonymous communication , Journal of Computer Security, 13, 6, pp. 839-876, (2002)
[10]  
Jens H.W.J., Christina O., Protecting privacy during peer-to-peer exchange of medical documents , Information Systems Frontiers, 14, 1, pp. 87-104, (2012)