Sinopsis
This book presents a new protocol for a scalable multicast key distribution protocol. The proposed protocol is based on Key Management using Boolean Function Minimization (KM-BFM) technique. It is considered one of the best solutions proposed for solving the scalability of multicast security protocols depending on a centralized manager. Instead of using one tree as in KM-BFM, the members are divided into a number of subgroup trees. The comparison of the proposed protocol with KM-BFM protocol shows that the proposed protocol achieves a lower storage at both the group manager and the group members compared to KM-BFM protocol. Also, it achieves a lower communication overhead in case of a single member leave and a comparable communication overhead in case of multiple leaves. Furthermore, the probability of conducting a successful collusion attack in the proposed protocol is less than that proposed in KM-BFM protocol. This is due to the fact that, in the proposed protocol, each member knows less number of keys than in KM-BFM protocol.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
This book presents a new protocol for a scalable multicast key distribution protocol. The proposed protocol is based on Key Management using Boolean Function Minimization (KM-BFM) technique. It is considered one of the best solutions proposed for solving the scalability of multicast security protocols depending on a centralized manager. Instead of using one tree as in KM-BFM, the members are divided into a number of subgroup trees. The comparison of the proposed protocol with KM-BFM protocol shows that the proposed protocol achieves a lower storage at both the group manager and the group members compared to KM-BFM protocol. Also, it achieves a lower communication overhead in case of a single member leave and a comparable communication overhead in case of multiple leaves. Furthermore, the probability of conducting a successful collusion attack in the proposed protocol is less than that proposed in KM-BFM protocol. This is due to the fact that, in the proposed protocol, each member knows less number of keys than in KM-BFM protocol.
Biografía del autor
Mohamed Rasslan received the B.Sc. and M.Sc. degrees from Cairo University & Ain Shams University, Egypt, and the Ph.D. degree from Concordia University, Canada. He worked at Egyptian Cabinet IDSC, TE Data S.A.E, the Egyptian MCIT, ERI, and the Elec. & Comp. Eng. Dept. Concordia University, Canada. He is the co-founder and chairman of SecRiva Inc.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Group Key Distribution in Computer Networks: GKD in...
Imagen del vendedor
Group Key Distribution in Computer Networks
Publicado por
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3659224928
ISBN 13: 9783659224928
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Rasslan MohamedMohamed Rasslan received the B.Sc. and M.Sc. degrees from Cairo University & Ain Shams University, Egypt, and the Ph.D. degree from Concordia University, Canada. He worked at Egyptian Cabinet IDSC, TE Data S.A.E, the E. Nº de ref. del artículo: 5141107
Comprar nuevo
EUR 64,43
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Group Key Distribution in Computer Networks : GKD in Computer Networks
Publicado por
LAP Lambert Academic Publishing, 2012
ISBN 10: 3659224928
ISBN 13: 9783659224928
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book presents a new protocol for a scalable multicast key distribution protocol. The proposed protocol is based on Key Management using Boolean Function Minimization (KM-BFM) technique. It is considered one of the best solutions proposed for solving the scalability of multicast security protocols depending on a centralized manager. Instead of using one tree as in KM-BFM, the members are divided into a number of subgroup trees. The comparison of the proposed protocol with KM-BFM protocol shows that the proposed protocol achieves a lower storage at both the group manager and the group members compared to KM-BFM protocol. Also, it achieves a lower communication overhead in case of a single member leave and a comparable communication overhead in case of multiple leaves. Furthermore, the probability of conducting a successful collusion attack in the proposed protocol is less than that proposed in KM-BFM protocol. This is due to the fact that, in the proposed protocol, each member knows less number of keys than in KM-BFM protocol. Nº de ref. del artículo: 9783659224928
Comprar nuevo
EUR 79,95
Envío por EUR 61,66
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen de archivo
Group Key Distribution in Computer Networks: GKD in Computer Networks
Publicado por
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3659224928
ISBN 13: 9783659224928
Antiguo o usado
Paperback
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Nº de ref. del artículo: ERICA79636592249286
Comprar usado
EUR 176,04
Envío por EUR 29,27
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles