Abstract
Time-bound hierarchical key assignment (TBHKA) scheme is a cryptographic method to assign encryption keys to a set of security classes in a partially ordered hierarchy. Only the authorized subscriber who holds the corresponding key can access the encrypted resources. In 2005, Yeh proposed a RSA-based TBHKA scheme which is suitable for discrete time period. However, it had been proved insecure against colluding attacks. Up to now, no such TBHKA schemes were proposed. In this paper, we fuse pairing-based cryptography and RSA key construction to propose a secure TBHKA scheme. In particular, our scheme is suitable for discrete time period. The security analysis is demonstrated that our scheme is secure against outsider and insider attacks (including colluding attacks). Finally, the performance analysis and comparisons are given to demonstrate our advantage.
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.
