Research Article
End-to-End Key Exchange through Disjoint Paths in P2P Networks
@ARTICLE{10.4108/sesa.2.3.e3, author={Daouda Ahmat and Damien Magoni and Tegawend\^{e} F. Bissyand\^{e}}, title={End-to-End Key Exchange through Disjoint Paths in P2P Networks}, journal={EAI Endorsed Transactions on Security and Safety}, volume={2}, number={3}, publisher={ICST}, journal_a={SESA}, year={2015}, month={1}, keywords={P2P networks, key management, Diffie-Hellman algorithm, MITM attacks, multipath routing, backtracking.}, doi={10.4108/sesa.2.3.e3} }- Daouda Ahmat
Damien Magoni
Tegawendé F. Bissyandé
Year: 2015
End-to-End Key Exchange through Disjoint Paths in P2P Networks
SESA
ICST
DOI: 10.4108/sesa.2.3.e3
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.
Copyright © 2014 Daouda Ahmat1 et al., licensed to ICST. This is an open access article distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.
