Introduction to finite fields and their applications
Introduction to finite fields and their applications
An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
Interaction in key distribution schemes
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Generalized Beimal-Chor schemes for broadcast encryption and interactive key distribution
Theoretical Computer Science
Communications of the ACM
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Key Trees and the Security of Interval Multicast
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Secure Group Communications Over Data Networks
Secure Group Communications Over Data Networks
KTDCKM-SDC: A Distributed Conference Key Management Scheme for Secure Dynamic Conferencing
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Communication in key distribution schemes
IEEE Transactions on Information Theory
Wireless telemedicine and m-health: technologies, applications and research issues
International Journal of Sensor Networks
Security and Communication Networks
EasiSec: a SoC security coprocessor based on fingerprint-based key management for WSN
International Journal of Sensor Networks
| Hi-index | 0.00 |
Conference Key Management (CKM) is one of the primary issues inSecure Dynamic Conferencing (SDC). In this paper, we propose anovel CKM scheme for SDC based on the secret sharing principle andthe novel concept/introduction of randomised access polynomial. Ourscheme is simple, efficient, scalable, practical, dynamic andoutperforms existing CKM schemes in overall comparison.Furthermore, if t or less users collude, the new scheme isunconditionally secure and able to defend against their collusions.The storage (O(1) at user end), computation and communicationefficiency of the new scheme makes it well suited for the networkswith low power devices.