Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Communication complexity of group key distribution
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Using encryption for authentication in large networks of computers
Communications of the ACM
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Password-Authenticated Key Exchange between Clients with Different Passwords
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Mutual authentication and group key agreement for low-power mobile devices
Computer Communications
| Hi-index | 0.00 |
Many of today's distributed applications are based on group communication. Given the openness of today's networks, communication among group members must be secure and, at the same time, efficient. In this paper we consider a realistic distributed setting modeling general networks, including the Internet, that suggests the use of Kerberos, and, more specifically, a distributed mode of operation of Kerberos, called crossrealm authentication protocol, as a desirable choice for distributed applications.We design an efficient protocol for secure group communication via multicast, using Kerberos. While developing the main components of our protocol, we construct an efficient paradigmfor crossrealmauthen tication protocols that decreases communication over the Internet, makes most operations local, and reduces the workload of the involved components. We also design extensions of single-center multicast encryption schemes to multiple-center schemes.