An Improved Authentication Scheme for Digital Rights Management System

Abstract

With the increasing number and popularity of digital content, the management of digital access rights has become an utmost important field. Through digital rights management systems (DRM-S), access to digital contents can be defined and for this, an efficient and secure authentication scheme is required. The DRM authentication schemes can be used to give access or restrict access to digital content. Very recently in 2020, Yu et al. proposed a symmetric hash and xor-based DRM and termed their system to achieve both security and performance efficiency. Contrarily, in this study, we argue that their scheme has several issues including nonresistance to privileged insider and impersonation attacks. Moreover, it is also to show in this study that their scheme has an incorrect authentication phase and due to this incorrectness, the scheme of Yu et al. lacks user scalability. An improved scheme is then proposed to counter the insecurities and incorrectness of the scheme of Yu et al. We prove the security of the proposed scheme using BAN logic. For a clear picture of the security properties, we also provide a textual discussion on the robustness of the proposed scheme. Moreover, due to the usage of symmetric key-based hash functions, the proposed scheme has a comparable performance efficiency.

Construction of a secure and efficient content key distribution framework for DRM systems

“…This section discusses the efficiency and security attributes of currently available authentication techniques and our proposed protocol for DRM systems. [10][11][12]17,19,20,27 In Tables 3 and 5, we analyze the costs associated with both the execution and the communication respectively of these methods. All of the tables above let us carry out comparative research in the aspect of security and performance.…”

“…Meanwhile, Hussain et al 20 demonstrated that Yu et al's 12 strategy was insecure and susceptible to privileged insider attacks, user impersonation attacks, and licensing server impersonation attacks while also proposing an improved authentication mechanism for the DRM system. However, Hussain et al stored the sensitive data on the server database and user smartcard.…”

“…However, Hussain et al stored the sensitive data on the server database and user smartcard. As a result, with the help of stolen smart card and offline password guessing attacks, 20 the scheme is susceptible to impersonation attack. In Table 4, we present an analysis of the security attributes of the related scheme.…”

“…Khan et al's 17 scheme computes +1 in the side, and computes . Thus total costs is approximately = 0.881436 s. In Hussain et al scheme, 20 side consumes , and executes a 9‐time hash function, which is approximately = 0.858961 seconds. In Fan et al scheme, 19 executes , executes six time hash function, which is approximately = 0.807086 s.…”

“…Thus total costs is approximately 7T h þ 1T f e þ T A B L E 2Execution cost for different cryptographic algorithms. = 0.881436 s. In Hussain et al scheme,20 U i side consumes 11T h þ T f e , and S j executes a 9-time hash function, which is approximately 20T h þ T f e = 0.858961 seconds. In Fan et al scheme,19 executes 7T h þ T f e , S j executes six time hash function, which is approximately 13T h þ T f e = 0.807086 s.…”