Abstract
Conference Key Management (CKM) is one of the primary issues in Secure Dynamic Conferencing (SDC). In this paper, we propose a novel CKM scheme for SDC based on the secret sharing principle and the novel concept/introduction of randomised access polynomial. Our scheme is simple, efficient, scalable, practical, dynamic and outperforms existing CKM schemes in overall comparison. Furthermore, if t or less users collude, the new scheme is unconditionally secure and able to defend against their collusions. The storage (O(1) at user end), computation and communication efficiency of the new scheme makes it well suited for the networks with low power devices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
