MUSe

Mobility, Ubiquity, Security

[LaBRI, Room 64, January 16th 2014 : 13h30]

The next presentation will be made by Daouda Ahmat who will talk about finding k-disjoint paths over graphs and key exchange through P2P networks.

Here is the abstract:

Due to their inherent features, P2P systems are subject to various security threats because traditional security infrastructures based on a centralized trusted entity could not be effectively  applied to them. In order to overcome these security issues, we propose to design a disjoint paths key exchange scheme.  Thus, to fulfill this goal, a some study on graph theory concepts is needed.

Classified in : Coffee Paper

Tags : P2P, key exchange