End-to-End Key Exchange through Disjoint Paths in P2P Networks

Authors

DOI:

https://doi.org/10.4108/sesa.2.3.e3

Keywords:

P2P networks, key management, Diffie-Hellman algorithm, MITM attacks, multipath routing, backtracking.

Abstract

Due to their inherent features, P2P networks have proven to be effective in the exchange of data between autonomous peers. Unfortunately, these networks are subject to various security threats that cannot be addressed readily since traditional security infrastructures, which are centralized, cannot be applied to them. Furthermore, communication reliability across the Internet is threatened by various attacks, including usurpation of identity, eavesdropping or traffic modification. Thus, in order to overcome these security issues and allow peers to securely exchange data, we propose a new key management scheme over P2P networks. Our approach introduces a new method that enables a secret key exchange through disjoint paths in the absence of a trusted central coordination point which would be required in traditional centralized security systems.

Downloads

Published

30-01-2015

How to Cite

Ahmat, D. ., Magoni, D. ., & F. Bissyandé, T. . (2015). End-to-End Key Exchange through Disjoint Paths in P2P Networks. EAI Endorsed Transactions on Security and Safety, 2(3), e3. https://doi.org/10.4108/sesa.2.3.e3