Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Discrete-time signal processing
Discrete-time signal processing
A fast algorithm for optimal length-limited Huffman codes
Journal of the ACM (JACM)
Elements of information theory
Elements of information theory
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Communication complexity of group key distribution
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Simulation Modeling and Analysis
Simulation Modeling and Analysis
SPINS: security protocols for sensor networks
Wireless Networks
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes
SIAM Journal on Computing
Efficient Security for Large and Dynamic Multicast Groups
WETICE '98 Proceedings of the 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
DISEC: A Distributed Framework for Scalable Secure Many-to-Many Communication
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Key distribution for secure multimedia multicasts via data embedding
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Tunstall adaptive coding and miscoding
IEEE Transactions on Information Theory - Part 2
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
Scalable secure group communication over IP multicast
IEEE Journal on Selected Areas in Communications
A survey of security issues in multicast communications
IEEE Network: The Magazine of Global Internetworking
Energy-efficient and scalable group key agreement for large ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
JET: dynamic join-exit-tree amortization and scheduling for contributory key management
IEEE/ACM Transactions on Networking (TON)
Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
IEEE Transactions on Dependable and Secure Computing
Hierarchical group access control for secure multicast communications
IEEE/ACM Transactions on Networking (TON)
Fast transmission to remote cooperative groups: a new key management paradigm
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
The Diffie-Hellman problem is often the basis for establishing conference keys. In heterogeneous networks, many conferences have participants of varying resources, yet most conference keying schemes do not address this concern and place the same burden upon less powerful clients as more powerful ones. The establishment of conference keys should minimize the burden placed on resource-limited users while ensuring that the entire group can establish the key. In this paper, we present a hierarchical conference keying scheme that forms subgroup keys for successively larger subgroups en route to establishing the group key. A tree, called the conference tree, governs the order in which subgroup keys are formed. Key establishment schemes that consider users with varying costs or budgets are built by appropriately designing the conference tree. We then examine the scenario where users have both varying costs and budget constraints. A greedy algorithm is presented that achieves near-optimal performance, and requires significantly less computational effort than finding the optimal solution. We provide a comparison of the total cost of tree-based conference keying schemes against several existing schemes, and introduce a new performance criterion, the probability of establishing the session key (PESKY), to study the likelihood that a conference key can be established in the presence of budget constraints. Simulations show that the likelihood of forming a group key using a tree-based conference keying scheme is higher than the GDH schemes of Steiner et al.. Finally, we study the effect that greedy users have upon the Huffman-based conference keying scheme, and present a method to mitigate the detrimental effects of the greedy users upon the total cost.