Rasslan mohamed (3 risultati)

- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 66,50
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Group Key Distribution in Computer Networks | GKD in Computer Networks | Mohamed Rasslan (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659224928 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.…

- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 64,43
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: 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. …

- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 86,42
EUR 35,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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.…