This specification proposes a protocol to create grouped symmetric keys and distribute them amongst communicating peers. This protocol has the following advantages: 1) virtually invisible to operator, 2) no central key distribution site is needed, 3) only group members have the key, 4) sender or receiver oriented operation, 5) can make use of multicast communications protocols.
RFC Downloads
Cited By
- Martina J and Paulson L (2015). Verifying multicast-based security protocols using the inductive method, International Journal of Information Security, 14:2, (187-204), Online publication date: 1-Apr-2015.
- Liu N, Tang S, Xu L and He D (2015). Analyses of several recently proposed group key management schemes, Security and Communication Networks, 8:2, (136-148), Online publication date: 25-Jan-2015.
- Chen C, Kuo T and Shih T (2014). Design of a secure communication and handoff protocol for VANETs, Journal of High Speed Networks, 20:3, (179-192), Online publication date: 1-Jul-2014.
- Wang Z (2013). A new authenticated group key transfer protocol for actual network environment, International Journal of Ad Hoc and Ubiquitous Computing, 12:3, (188-192), Online publication date: 1-Mar-2013.
- Martina J and Paulson L Verifying multicast-based security protocols using the inductive method Proceedings of the 28th Annual ACM Symposium on Applied Computing, (1824-1829)
- Krishnan R, Niu J, Sandhu R and Winsborough W (2011). Group-Centric Secure Information-Sharing Models for Isolated Groups, ACM Transactions on Information and System Security (TISSEC), 14:3, (1-29), Online publication date: 1-Nov-2011.
- Song J, Jung S and Kim S (2018). Research on A-key distribution algorithms for protecting data of RS-485-based industrial infrastructure, WSEAS Transactions on Computers, 9:9, (982-991), Online publication date: 1-Sep-2010.
- Aparna R and Amberker B (2018). A key management scheme for secure group communication using binomial key trees, International Journal of Network Management, 20:6, (383-418), Online publication date: 1-Nov-2010.
- Obaidat M and Sundararajan M (2009). New enhancements to the SOCKS communication network security protocol, Journal of Systems and Software, 82:12, (1941-1949), Online publication date: 1-Dec-2009.
- Zhou J and Ou Y Key Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing, (254-265)
- Wang N, Huang Y and Chen W (2019). A novel secure communication scheme in vehicular ad hoc networks, Computer Communications, 31:12, (2827-2837), Online publication date: 15-Jul-2008.
- Fischer M, Schaefer G, Schmidt R and Strufe T A key management solution for overlay-live-streaming Proceedings of the workshop on Security in Opportunistic and SOCial networks, (1-10)
- Li J, Bhattacharjee B, Yu M and Levy R (2008). A scalable key management and clustering scheme for wireless ad hoc and sensor networks, Future Generation Computer Systems, 24:8, (860-869), Online publication date: 1-Oct-2008.
- Alhammouri M and Muftic S Management of groups and group keys in multi-level security environments Proceedings of the 26th international conference on Computer Safety, Reliability, and Security, (75-80)
- Zheng M, Cui G, Yang M and Li J Scalable group key management protocol based on key material transmitting tree Proceedings of the 3rd international conference on Information security practice and experience, (301-313)
- Raya M and Hubaux J (2018). Securing vehicular ad hoc networks, Journal of Computer Security, 15:1, (39-68), Online publication date: 1-Jan-2007.
- Yitao Duan and Canny J Scalable Secure Bidirectional Group Communication Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (875-883)
- Hu F, Siddiqui W and Sankar K (2019). Scalable security in wireless sensor and actuator networks (WSANs), Computer Networks: The International Journal of Computer and Telecommunications Networking, 51:1, (285-308), Online publication date: 17-Jan-2007.
- Fang W and Dazhen W An group key distribution protocol for secure group communications Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6, (519-527)
- Zheng X, Huang C and Matthews M Chinese remainder theorem based group key management Proceedings of the 45th annual southeast regional conference, (266-271)
- Ng W, Howarth M, Sun Z and Cruickshank H (2007). Dynamic Balanced Key Tree Management for Secure Multicast Communications, IEEE Transactions on Computers, 56:5, (590-605), Online publication date: 1-May-2007.
- Nemaney Pour A, Kumekawa K, Kato T and Itoh S (2007). A hierarchical group key management scheme for secure multicast increasing efficiency of key distribution in leave operation, Computer Networks: The International Journal of Computer and Telecommunications Networking, 51:17, (4727-4743), Online publication date: 1-Dec-2007.
- LieHuang Z, YuanDa C, LeJian L and DaZhen W Secure group key distribution protocol for distributed systems Proceedings of the 5th WSEAS international conference on Applied computer science, (86-95)
- LieHuang Z, YuanDa C, LeJian L and DaZhen W SKQML Proceedings of the 5th WSEAS international conference on Applied computer science, (57-61)
- Duan Y and Canny J How to construct multicast cryptosystems provably secure against adaptive chosen ciphertext attack Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology, (244-261)
- Pegueroles J, Fernández M, Rico-Novella F and Soriano M A practical solution for distribution rights protection in multicast environments Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III, (527-536)
- Raya M, Aziz A and Hubaux J Efficient secure aggregation in VANETs Proceedings of the 3rd international workshop on Vehicular ad hoc networks, (67-75)
- Padmavathi G and Annadurai S (2018). A security framework for Content-Based Publish-Subscribe system, Electronic Commerce Research and Applications, 5:1, (78-90), Online publication date: 1-Jul-2006.
- Srivatsa M and Liu L Countering targeted file attacks using locationguard Proceedings of the 14th conference on USENIX Security Symposium - Volume 14, (6-6)
- Wang W and Bhargava B Key distribution and update for secure inter-group multicast communication Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks, (43-52)
- Lu H (2005). A Novel High-Order Tree for Secure Multicast Key Management, IEEE Transactions on Computers, 54:2, (214-224), Online publication date: 1-Feb-2005.
- Huang D and Medhi D (2004). A key-chain-based keying scheme for many-to-many secure group communication, ACM Transactions on Information and System Security (TISSEC), 7:4, (523-552), Online publication date: 11-Nov-2004.
- Park T and Shin K (2004). LiSP, ACM Transactions on Embedded Computing Systems (TECS), 3:3, (634-660), Online publication date: 1-Aug-2004.
- Di Pietro R, Mancini L and Mei A (2018). Key management for high bandwidth secure multicast, Journal of Computer Security, 12:5, (693-709), Online publication date: 1-Sep-2004.
- Challal Y, Bettahar H and Bouabdallah A (2004). SAKM, ACM SIGCOMM Computer Communication Review, 34:2, (55-70), Online publication date: 1-Apr-2004.
- Blessing R and Uthariaraj R Evaluation and analysis of computational complexity for secure multicast models Proceedings of the 2003 international conference on Computational science and its applications: PartII, (684-694)
- Rafaeli S and Hutchison D (2003). A survey of key management for secure group communication, ACM Computing Surveys (CSUR), 35:3, (309-329), Online publication date: 1-Sep-2003.
- Liu D, Ning P and Sun K Efficient self-healing group key distribution with revocation capability Proceedings of the 10th ACM conference on Computer and communications security, (231-240)
- Sherman A and McGrew D (2003). Key Establishment in Large Dynamic Groups Using One-Way Function Trees, IEEE Transactions on Software Engineering, 29:5, (444-458), Online publication date: 1-May-2003.
- Tseng Y (2018). A scalable key-management scheme with minimizing key storage for secure group communications, International Journal of Network Management, 13:6, (419-425), Online publication date: 1-Nov-2003.
- Di Pietro R, Mancini L and Jajodia S Efficient and secure keys management for wireless mobile communications Proceedings of the second ACM international workshop on Principles of mobile computing, (66-73)
- Chu H, Qiao L, Nahrstedt K, Wang H and Jain R (2002). A secure multicast protocol with copyright protection, ACM SIGCOMM Computer Communication Review, 32:2, (42-60), Online publication date: 1-Apr-2002.
- Zhang C, DeCleene B, Kurose J and Towsley D (2019). Comparison of inter-area rekeying algorithms for secure wireless group communications, Performance Evaluation, 49:1-4, (1-20), Online publication date: 1-Sep-2002.
- Tseng C, Wu K, Lin J, Chou C and Lai F A Constant Size Rekeying Message Framework for Secure Multicasting Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
- Opyrchal L and Prakash A Secure distribution of events in content-based publish subscribe systems Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
- (2001). The architecture and performance of security protocols in the ensemble group communication system, ACM Transactions on Information and System Security, 4:3, (289-319), Online publication date: 1-Aug-2001.
- Li X, Yang Y, Gouda M and Lam S Batch rekeying for secure group communications Proceedings of the 10th international conference on World Wide Web, (525-534)
- Hardjono T Router-Assistance for Receiver Access Control in PIM-SM Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
- Ghanem S and Abdel-Wahab H A Simple XOR-Based Technique for Distributing Group Key in Secure Multicasting Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
- Dondeti L, Mukherjee S and Samal A (2000). Scalable secure one-to-many group communication using dual encryption, Computer Communications, 23:17, (1681-1701), Online publication date: 1-Nov-2000.
- Steiner M, Tsudik G and Waidner M (2000). Key Agreement in Dynamic Peer Groups, IEEE Transactions on Parallel and Distributed Systems, 11:8, (769-780), Online publication date: 1-Aug-2000.
- McDaniel P, Prakash A and Honeyman P Antigone Proceedings of the 8th conference on USENIX Security Symposium - Volume 8, (9-9)
- Wong C, Gouda M and Lam S (2019). Secure group communications using key graphs, ACM SIGCOMM Computer Communication Review, 28:4, (68-79), Online publication date: 1-Oct-1998.
- Wong C, Gouda M and Lam S Secure group communications using key graphs Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, (68-79)
- Mittra S (2019). Iolus, ACM SIGCOMM Computer Communication Review, 27:4, (277-288), Online publication date: 1-Oct-1997.
- Mittra S Iolus Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication, (277-288)
- Steiner M, Tsudik G and Waidner M Diffie-Hellman key distribution extended to group communication Proceedings of the 3rd ACM conference on Computer and communications security, (31-37)
Recommendations
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
SCN '08: Proceedings of the 6th international conference on Security and Cryptography for NetworksThe universal composability (UC) framework by Canetti [15] is a general-purpose framework for designing secure protocols. It ensures the security of UC-secure protocols under arbitrary compositions. As key exchange protocols (KEs) belong to the most ...
Universally composable contributory group key exchange
ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications SecurityWe treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by malicious insiders. We define an ideal functionality for GKE that captures ...