Supporting mobility in GKM over ad-hoc network using a decentralized and spontaneous algorithm
Supporting Mobility in GKM over Ad-Hoc Network Using a Decentralized and Spontaneous Algorithm (1,497Mb) (Restricted access) Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Document typeConference report
Rights accessRestricted access - publisher's policy
Recently there have been a noticeable growth of ad-hoc environments with peer-to-peer relations. Such environments decentralize the services in order to share their cost between their members. As a result, a decentralized security scheme for the group members must be also provided. Group Key Management (GKM) deals with the responsibility of providing privacy and group authentication in group communications, but until now it is based either in centralized solutions, useless for peer-to-peer groups, or in contributory key schemes, that require a known group size. We propose a GKM algorithm targeted to ad-hoc environments that it is decentralized and allows members to only know their one-hop neighbors. Moreover our presented algorithm can deal with the potential mobility of the ad-hoc devices.
CitationJuan Hernández Serrano; Pegueroles, J.; Soriano, M. Supporting mobility in GKM over ad-hoc network using a decentralized and spontaneous algorithm. A: International Conference on Computational Science and its Applications. "Computational science and its applications - ICCSA 2007 : international conference, Kuala Lumpur, Malaysia, August 26-29, 2007; proceedings ; Pt. 2". Kuala Lumpur: Springer, 2007, p. 526-539.
|Supporting Mobility in GKM over Ad-Hoc Network.pdf||Supporting Mobility in GKM over Ad-Hoc Network Using a Decentralized and Spontaneous Algorithm||1,497Mb||Restricted access|