Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Authentication: from passwords to public keys
Authentication: from passwords to public keys
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Using AVL Trees for Fault Tolerant Group Key Management
Using AVL Trees for Fault Tolerant Group Key Management
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Combinatorial Optimization of Group Key Management
Journal of Network and Systems Management
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
On the performance of group key agreement protocols
ACM Transactions on Information and System Security (TISSEC)
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Key Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Group key agreement for secure group communication in dynamic peer systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we optimize the number of re-key broadcast messages, user-side key computation, and number of key storages. The first protocol is the base Chinese Remaindering Group Key (CRGK) protocol, which with a group of n users requires the key server to do O(n) XORs, additions, multiplications, and Extended Euclidean Algorithm computations and broadcast 1 re-key message; each individual user is required to do only 1 modulo arithmetic and 1 XOR operation for each group key update. The second protocol is the Fast Chinese Remaindering Group Key (FCRGK) protocol, which only requires the key server to do O(n) XORs, additions, and multiplications most of the times with no change to the number of re-key messages and user computation per group key update. For both protocols each user only needs to store 2 keys all the time. One special attraction for our FCRGK protocol is that it allows most of the re-keying computation to be done preemptively, which means when a user-join or user-leave event happens the response time for the key server to send out the new group key can be very short.