Exploring robustness in group key agreement
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Secure group communication is crucial for building distributed applications that work in dynamic environments and communicate over unsecured networks (e.g. the Internet). Key agreement is a critical part of providing security services for group communication systems. Most of the current contributory key agreement protocols are not designed to tolerate failures and membership changes during execution. In particular, nested or cascaded group membership events (such as partitions) are not accommodated. We present the first robust contributory key agreement protocols, resilient to any sequence of events while preserving the group communication membership and ordering guarantees.Keywords
This publication has 17 references indexed in Scilit:
- Handbook of Applied CryptographyPublished by Taylor & Francis ,2018
- Transis: a communication subsystem for high availabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Extended virtual synchronyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The SecureRing protocols for securing group communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New multiparty authentication services and key agreement protocolsIEEE Journal on Selected Areas in Communications, 2000
- Secure group communication in asynchronous networks with failures: integration and experimentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2000
- Scalable group membership services for novel applicationsPublished by American Mathematical Society (AMS) ,1998
- HorusCommunications of the ACM, 1996
- The Totem single-ring ordering and membership protocolACM Transactions on Computer Systems, 1995
- Exploiting virtual synchrony in distributed systemsPublished by Association for Computing Machinery (ACM) ,1987