Preventing Collusion Attacks on the One-Way Function Tree (OFT) Scheme

Authors:
Xuxin Xu;Lingyu Wang;Amr Youssef;Bo Zhu
Affiliations:
Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC H3G 1M8, Canada;Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC H3G 1M8, Canada;Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC H3G 1M8, Canada;Center for Secure Information Systems, George Mason University, Fairfax, VA 22030-4444, USA
Venue:
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Year:
2007

Citing 6
Cited 0

Secure group communications using key graphs

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Key Establishment in Large Dynamic Groups Using One-Way Function Trees

IEEE Transactions on Software Engineering
Multicast and Group Security

Multicast and Group Security
Efficient Group Key Management Protocol with One-Way Key Derivation

LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Scalable group key management with partially trusted controllers

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
A survey of security issues in multicast communications

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The one-way function tree (OFT) scheme proposed by Balenson et al.is widely regarded as an efficient key management solution for multicast communication in large dynamic groups. Following Horng's claim that the original OFT scheme was vulnerable to a collusion attack, Ku et al.studied the collusion attack on OFT and proposed a solution to prevent the attack. The solution, however, requires to broadcast about h2+ h(his the height of the key tree) keys for every eviction operation, whereas the original OFT scheme only requires about hkeys. This modified OFT scheme thus loses a key advantage that the original OFT has over the logical key hierarchy (LKH) scheme, that is a halving in broadcast size. In this paper, we revisit collusion attacks on the OFT scheme. We generalize the examples of attacks given by Horng and Ku et al.to a generic collusion attack on OFT, and derive necessary and sufficient conditions for such an attack to exist. We then show a solution for preventing collusion attacks while minimizing the average broadcast size. Our simulation results show that the proposed solution allows OFT to outperform LKH in many cases.