期刊文献+

一种P2P网络中的隐蔽搜索模型 被引量:3

A Concealment Searching Model in P2P Network
下载PDF
导出
摘要 随着peer-to-peer(P2P)网络应用的不断发展,网络中的隐私保护问题引起了广泛的关注.当前研究主要集中在匿名通信机制的实现,而这些匿名技术通常需要复杂的系统结构,增加了开发维护代价以及网络管理的难度,同时也增大了传输延迟.针对P2P网络,尤其是无搜索服务器的P2P网络中用户搜索内容隐私保护的问题,提出了基于单向函数和Soundex算法的隐蔽搜索模型.该模型能够保护用户的搜索内容、抵抗窃听、重放、身份冒充等攻击,并且支持精确搜索和模糊搜索.分析表明隐蔽搜索模型具有较高的安全性和搜索有效性. With the development of application of the peer-to-peer networks, the problem of the privacy preservation has aroused extensive concern. Though many previous researches have focused on the realization of the anonymous communications, these anonymous technologies usually need complex structures which increase the cost of maintenance and the difficulty of management, and prolong the transmission delay. Aimed at the privacy preservation of searching content in P2P network, especially the network without searching server, a concealment searching model based on one-way function and Soundex algorithm is proposed. It can protect searching content of peers and resist attacks of snooping, replay, disguise and so on, meanwhile the model support accurate search and fuzzy search. According to the analysis, this concealment searching model achieves relatively high security as well as searching effectivity.
出处 《计算机研究与发展》 EI CSCD 北大核心 2008年第z1期370-374,共5页 Journal of Computer Research and Development
基金 教育部博士点基金项目(20060358011)
关键词 隐蔽搜索 HASH函数 RSA算法 Soundex算法 concealment searching Hash function RSA algorithm Soundex algorithm
  • 相关文献

参考文献9

  • 1[1]S Androutsellis-Theotokis,D Spinellis.A survey of peer-to-peer content distribution technologies.ACM Computing Surveys,2004,36(4):335-371
  • 2李旭华,叶飞跃,蒙德龙.P2P网络中基于代理合作的匿名传输机制[J].计算机应用,2006,26(1):70-71. 被引量:4
  • 3[4]The Annotated Gnutella Protocol Specification v0.4.http://rfc-gnutella.sourceforge.net/developer/stable/index.html,2001
  • 4[5]V Vishnumurthy,S Chandrakumar,E G Sirer.KARMA:A secure economic framework for P2P resource sharing.The 1st Workshop on Economics of Peer-to-Peer Systems,Berkeley,CA,2003
  • 5[6]U Lee,M Choi,J Cho,et al.Understanding pollution dynamics in P2P file sharing.The 5th Int'l Workshop on Peer-to-Peer Systems (IPTPS'06),Santa Barbara,CA,2006
  • 6[7]Qinyuan Feng,Yafei Dai.LIP:A lIfetime and popularity based ranking approach to filter out fake files in P2P file sharing systems.The 6th Int'l Workshop on Peer-to-Peer Systems (IPTPS'07),Bellevue,WA,2007
  • 7[8]S Saroiu,P K Gummadi,S D Gribble.A measurement study of peer-to-peer file sharing systems.Multimedia Computing and Network 2002 (MMCN'02),San Jose,CA,2002
  • 8时金桥,程晓明.匿名通信系统中自私行为的惩罚机制研究[J].通信学报,2006,27(2):80-86. 被引量:5
  • 9[10]Matei A Zaharia,Amit Chandel,Stefan Saroiu,et al.Finding content in file-sharing networks when you can't even spell.Int'l Workshop on P2P Systems,Bellevue,Washingtan,2007

二级参考文献18

  • 1Napster-file sharing system[EB/OL]. http://www.napster.com/,2005 - 05.
  • 2Clips. The Gnutella Protocol pecifications v0.4[EB/OL]. http:/dss. clio2. com/Gnutella Protocol 04. pdf, 2005 - 05.
  • 3Clarke I, Sandberg O, Wiley B, et al. Freenet: A distributed anonymous information storage and retrieval system[A]. Proceedings of International Workshop on Designing Privacy Enhancing Technologies:Design Issues in Anonymity and Unobservability[C].Berkeley. CA: Springer'Verlag, 2001.46 -66.
  • 4Searlata V, Levine BN, Shields C. Responder anonymity and anonymous peer to peer file sharing[A]. Proceedings of the 9th International Conference on Network Protocols( ICNP2001 )[C].Riverside, CA: IEEE Computer Society, 2001.272 - 280.
  • 5Reed M, Syverson P, Goldschlag D. Proxies for anonymous routing[A]. Proceedings of 12th Annual Computer Security Applications Conference[C]. Sandiego, CA: IEEECS Press, 1996.95-104.
  • 6Reiter MK, Rubin AD. Crowds: Anonymity for Web transactions[J]. ACM Transaction Information and System Security, 1998, 1(1):66 - 92.
  • 7GUAN Y,FU X,BETTATI R.An optimal strategy for anonymous communication protocols[A].22nd International Conference on Distributed Computing Systems (ICDCS '02)[C].Vienna,Austria,2002.257-270.
  • 8GOEL S,ROBSON M,POLTE M.Herbivore:a scalable and efficient protocol for anonymous communication[EB/OL].http://www.cs.cornell.edu/People/egs/papers/herbivore-tr.pdf,2003.
  • 9BRUALDI R A.Introductory Combinatorics,3rd ed[M].Prentice Hall,1998.
  • 10REITER M,RUBIN A.Crowds:anonymity for web transactions[J].ACM Transactions on Information and System Security,1998,1(1):66-92.

共引文献7

同被引文献20

  • 1韩军,曾晓洋,汤庭鳌.RSA密码算法的功耗轨迹分析及其防御措施[J].计算机学报,2006,29(4):590-596. 被引量:19
  • 2Ferreira R A. Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks[C]//Proceedings of IEEE P2P'05. Konstanz, Germany: IEEE Press, 2005.
  • 3Zhong Ming, Shen Kai. Popularity-based Random Walks for Peer-to-Peer Search under the Square-Root Principle[C]//Proc. of IPTPS'06. Santa Barbara, CA, USA: [s. n.], 2006.
  • 4Chen Avin, Bhaskar K. The Power of Choice in Random Walks: An Empirical Study[J]. Computer Networks, 2008, 52(1): 44-60.
  • 5Baek J,Steinfeld R,Zheng Y.Forraal proofs for the security of signcryption[J].Journal of Cryptology,2007,20(2):203-235.
  • 6冯登国.密码学原理与实践[M].3版.北京:清华大学出版社,2009:248-265.
  • 7Stallings W.密码学编码学与网络安全--原理与实践[M].孟庆树,王丽娜,傅建明,等译.4版.北京:电子工业出版社,2006:338-378.
  • 8Krawczyk H.HMQV:A high-performance secure Diffie-Hellman protocol[C].Advances in Cryptology Crypto'2005,LNCS 3621,Springer-Verlag,2005:546-566.
  • 9Toorani M,Beheshti Shirazi A A.LPKI A lightweight public key infrastrncture for the mobile environments[C].Gaangzbou,China:Proceedings of the 11th IEEE International Conference on Communication Systems,2008:162-166.
  • 10汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究[J].计算机研究与发展,2007,44(9):1566-1571. 被引量:13

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部