A communication--computation efficient group key algorithm for large and dynamic groups

DOI10.1016/J.COMNET.2006.03.008zbMATH Open1118.68062OpenAlexW2023108578MaRDI QIDQ856712FDOQ856712

Authors: Shanyu Zheng, David Manz, Jim Alves-Foss 

Publication date: 7 December 2006

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2006.03.008

Recommendations

• On the optimization of key agreement algorithms in dynamic peer groups
• Key management protocols for group communication
• Algorithms for dynamic multicast key distribution
• scientific article; zbMATH DE number 2154500
• TRING: A new framework for efficient group key distribution for dynamic groups

zbMATH Keywords

securitycommunication complexitycryptographic protocolsgroup key managementgroup communications

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cited In (5)

• Minimizing center key storage in hybrid one-way function based group key management with communication constraints
• Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
• A new two-round dynamic authenticated contributory group key agreement protocol using elliptic curve Diffie-Hellman with privacy preserving public key infrastructure
• On the optimization of key agreement algorithms in dynamic peer groups
• On the Minimum Communication Effort for Secure Group Key Exchange

This page was built for publication: A communication--computation efficient group key algorithm for large and dynamic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856712)