期刊文献+

一种P2P匿名控制身份鉴别机制 被引量:1

An Authentication Mechanism with Controlled Anonymity in P2P Systems
原文传递
导出
摘要 为解决一般的身份鉴别机制不适用于具有匿名通信要求的P2P网络系统模型的难题。通过对Diffle-Hellman密钥协商协议进行改进,并结合采用RSA数字签名协议,以及零知识证明GQ协议,提出了一种新的基于服务令牌对P2P匿名通信系统中的通信双方进行身份鉴别的机制。该机制在保证P2P匿名通信系统各种普遍特征的前提下,通过在P2P匿名通信系统中引入可信第三方节点,针对P2P匿名通信系统中各通信节点进行匿名控制和行为管理,同时既可抵御各种常见网络攻击的威胁,又有效实现了P2P匿名通信系统的身份鉴别,从而有效提高了P2P匿名通信系统的安全性,加强了此种系统的管理能力。 To address the problem that the common authentication mechanism is not applicable to the P2P network system model with anonymous communication requirements.This paper,based on the improvement of the Diffle-Hellman key agreement protocol and the combination of the RSA digital signatures agreements and zero-knowledge proof GQ agreement,proposes a new token-based services authentication mechanism to identify the nodes in P2P anonymous communication systems.This mechanism,with the premise of guaranteeing various general characteristics of P2P anonymous communication system and introduction of the trusted third party node into P2P anonymous communication system,implements anonymous control and behavior management of various communication nodes in P2P anonymous communication system.It could resist the threat of various common networks attack and realize effective authentication of P2P anonymous communication system,thus improving the security management ability of P2P anonymous communication system.
出处 《通信技术》 2010年第5期116-118,共3页 Communications Technology
关键词 P2P 匿名控制 身份鉴别 零知识证明 P2P anonymity controlled identity authentication Zero knowledge Proof
  • 相关文献

参考文献6

二级参考文献9

  • 1Schollmeier Rudiger. Why P2P does scale: Analysis of P2P traffic patterns[C].In Conference. Linkoping Computer Society Press Proceeding of the IEEE P2P Computing Sweden. 2003. Washington US: IEEE 2002:112-119.
  • 2Brickell E, Camenisch J, Chen Liqun. Direct Anonymous Attestation [C].In: Proceedings of the llth ACM Conferenceon Computer and Communication Security. New York: Association for Computing Machinery, 2004: 132-145.
  • 3Camenisch J, Stadler M. Efficient group signature schemes for large groups []]. Advances in Cryptology-CRYPTO' 97, 1997(1296): 410-424.
  • 4Camenisch J, Lysyanskaya A. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation [J]. Advances in Cryptology EUROC -RYPT, 2001(2045): 93 118.
  • 5Trusted Computing Group.Trusted platform module main specification,part1:design principles,part 2:TPM structures,Part3:commands[S/OL].[2006-03].http://www.trustedcomputinggroup.org.
  • 6Balfe S,Lakhani A D,Paterson K G.Securing peer-to-peer networks using trusted computing[M]//Mitchell C J.Trusted Computing[S.l]:IEEE Press,2005:271-298.
  • 7Sailer R,Zhang R,Design and implementation of a TCG-based integrity measurement architecture[C]//Proceedings of the 13th Unix Security Symposium,San Diego,2004.
  • 8England P,Lampson B,Manferdelli J,et al.A trusted open platform[J].IEEE Computer,2003,36(7):55-62.
  • 9Balfe S,Lakhani A D,Paterson K G.Trusted computing:providing security for Peer-to-Peer networks[C]//Caronni G.Proc Fifth International Conference on Peer-to-Peer Computing.IEEE Computer Society,2005:117-124.

共引文献16

同被引文献6

  • 1张虎强,洪佩琳,李津生,熊继平.一种零知识证明协议的安全分析与改进[J].信息安全与通信保密,2006,28(11):163-166. 被引量:4
  • 2林华,鲁荣波.椭圆曲线密码算法在零知识证明方案中的应用[J].信息安全与通信保密,2007,29(3):99-101. 被引量:2
  • 3CANETTI R. Universally Compostable Security: A New Paradigm for Crypto-graphic Protocols[EB/OL]. [2012-02-11]. http: //eDrint.iacr.or /2000/067.
  • 4GOLDWASSER S, MICALI S, RACKOFF C. The Knowledge Complexity of Interactive Proofsystems[J]. Siam Journal of Computing, 1989, 18: 186-208.
  • 5LINDELL Y. General Composition and Universal Composability in Secure Multi-party Computation[C]//44'h Foundations of Computer Science.Is.1.]: IEEE, 2003: 394-403.
  • 6BLUM M. Howto Prove a Theorem so no One Else can Claim It[C]// Proceedings of the International Congress of Mathematicians. Berkeley, California: [s.n.], 1986: 444-451.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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