...
首页> 外文期刊>Fortschritt-Berichte VDI >Toward Authentication between familiar Peers in P2P Networking Systems
【24h】

Toward Authentication between familiar Peers in P2P Networking Systems

机译:在P2P网络系统中熟悉的对等点之间进行身份验证

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Due to the anonymity of peers in P2P networking systems and absence of a CA, the authentication of peers is the main problem. A secure environment can only be achieved, when peers are sure, that they are communicating with the partner desired. After the first contact peers are known to each other. But there is still the possibility that a malicious peer masquerades itself as another one using a spoofing attack. A mechanism is needed to ensure secure re-authentication of peers, who have met each other once and are known to each other. This work focuses exactly on this problem and proposes a mechanism for familiar peers to get certainty about the identity of their known communication partner. The proposed mechanism combines a cryptographic protocol inspired by the dinner cryptographic protocol and zero knowledge protocol to ensure continuously re-authentication of peers in each new session.
机译:由于P2P网络系统中对等方的匿名性和缺少CA,对等方的身份验证是主要问题。仅当对等方确定他们正在与所需的伙伴进行通信时,才能实现安全的环境。在第一次联系之后,对等方彼此认识。但是,仍然存在恶意对等体使用欺骗攻击伪装成另一个对等体的可能性。需要一种机制来确保对等体的安全重新认证,对等体已经碰面一次并且彼此已知。这项工作正是针对此问题,并提出了一种机制,可使熟悉的对等方确定其已知通信伙伴的身份。所提出的机制结合了由晚餐密码协议和零知识协议启发的密码协议,以确保在每个新会话中对等点进行连续的重新认证。

著录项

  • 来源
    《Fortschritt-Berichte VDI》 |2016年第848期|88-103|共16页
  • 作者

    Fariborz Nassermostofi;

  • 作者单位

    Communication Networks Faculty of Mathematics and Computer Science FernUniversitaet in Hagen, Germany;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号