期刊文献+

基于声誉的P2P匿名通信方案研究

ON REPUTATION BASED P2P ANONYMOUS COMMUNICATION SCHEME
下载PDF
导出
摘要 P2P匿名通信系统需要系统成员共同参与信息转发,而部分不积极参与通信的成员的"Free-riding"行为将导致匿名系统性能降低。针对P2P匿名系统中部分成员不积极参与匿名转发信息的自私行为,基于区分服务思想提出一种基于声誉的匿名通信方案,该方案通过成员之间互相监督发送信息次数,降低了不积极参与信息转发成员的声誉值,使不同声誉值的成员获得的匿名性能不一样。理论分析和计算数据表明,应用声誉机制能确保正常成员的匿名度不变,但降低自私成员的匿名度,从而有效减少部分成员不积极参与转发匿名信息的自私行为。 The performance of Peer-to-Peer anonymous communication system relies on all members participating in information forwarding,but the free-riding behaviours of part of the members who are inactive in communication will cause system performance decline. In order to solve such selfish behaviour of inactive participation of information forwarding by part of the members in P2P anonymous system,an anonymous communication scheme based on reputation is proposed in this paper with respect to the idea of differentiated service. The scheme reduces reputation value of the inactive members by monitoring the frequency of messages forwarding each other amongst the members,which makes the members in the system obtain different anonymous performance upon different reputation value. Theoretical analysis and computation data all show that applying reputation mechanism can guarantee the anonymous degree of normal members while punish the selfish members by decreasing their anonymity degree,thus effectively decreases the selfish behaviours of part of the members in free-riding.
作者 霍成义
出处 《计算机应用与软件》 CSCD 2010年第4期40-41,44,共3页 Computer Applications and Software
基金 国家自然科学基金项目(60503008) 甘肃国防科工委(办)科研项目(Gb2007-3)
关键词 P2P 匿名通信 搭便车 声誉机制 区分服务 Peer to peer Anonymous communication Free-riding Reputation mechanism Differentiated service
  • 相关文献

参考文献4

二级参考文献39

  • 1GUAN 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.
  • 2GOEL 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.
  • 3BRUALDI R A.Introductory Combinatorics,3rd ed[M].Prentice Hall,1998.
  • 4REITER M,RUBIN A.Crowds:anonymity for web transactions[J].ACM Transactions on Information and System Security,1998,1(1):66-92.
  • 5RENNHARD M,PLATTNER B.Introducing MorphMix:peer-to-peer based anonymous internet usage with collusion detection[A].Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2002)[C].Washington D C,USA,2002.91-102.
  • 6FREEDMAN M J,MORRIS R.Tarzan:A peer-to-peer anonymizing network layer[A].Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS'02)[C].Washington D C,USA,2002.193-206.
  • 7SWEENY J.An experimental investigation of the free-riding problem[J].Social Science,1973,2(3):277-292.
  • 8THORN B,CONNOLLY T.Discretionary data bases,discretionary data bases:a theory and some experimental findings[J].Communication Research,1987,14(5):512-528.
  • 9SAROIU S,GUMMADI P,GRIBBLE S.A measurement study of peer-to-peer file sharing systems[A].Proceedings of Multimedia Computing and Networking 2002 (MMCN '02)[C].San Jose,CA,USA,2002.156-170.
  • 10Divac-Krnic L,Ackermann R.Secure-related issues in peer-to-peer networks[C].In:P2P Systems and Applications,Lecture Notes on Computer Science 3485,2005,529-545.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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