Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
New constructions for multicast re-keying schemes using perfect hash families
Proceedings of the 7th 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
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Communication-efficient group key agreement
Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Quick Group Key Distribution Scheme with "Entity Revocation"
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On the Performance of Group Key Agreement Protocols
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Efficient re-keying protocols for multicast encryption
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
| Hi-index | 0.00 |
In this paper we propose a secure group communication model with low communication complexity using multiplicative one-way functions and exclusive keys. When totally n users are in the group, it reduces the complexity of multicast message required in join or leave operation from O(log n) to O(1) keeping other complexities comparable. Therefore, it is very applicable to a wide area network environment or a low-bandwidth channel such as ad hoc network.