Analysis and Improvement of a Lightweight Anonymous Authentication Protocol for Mobile Pay-TV Systems

Abstract

For many years, the pay-TV system has attracted a lot of users. Users have recently expressed the desire to use mobile TV or mobile payment via anonymous protocols. The mobile users have also received their services over cellular communications networks. Each mobile device receives services from each head end systems. With increasing numbers of users and the expansion of Internet, user's privacy has become crucial important. When a device leaves the head end system's range, it must receive services from another head end system. In this paper, we review Chen et al's scheme and we highlight some weaknesses, including privilege insider attack and user traceability attack. Finally, we alleviate the scheme and analyze the alleviated scheme using both heuristic and formal methods.

An Efficient Anonymous Authentication Scheme for Mobile Pay-TV Systems

“…However, Kim and Lee showed that Chen et al's protocol suffers the risks in password guessing attack and impersonation attack and gave an improved version [33]. In 2018, Far and Alagheband also enhanced the security in Chen et al's protocol to alleviate its security risks [15].…”

“…Zhu presented a deniable authentication protocol for pay-TV system based on chaotic maps, which is called DAP-TV [41]. In 2020, [28] Designed an improved version using RSA blind signature technology Wang and Laith [21] 2008 Huang et al [20] Proposed an improved key distribution scheme Sun and Leu [34] 2009 Yang and Chang [31] Designed the first one-to-many authentication scheme Wang and Qin [35] 2012 Sun and Leu [34] Presented an enhanced scheme against impersonation attacks Kim and Lee [33] 2012 Chen et al [32] Gave an improved version against password guessing attack and impersonation attack Arshad et al [36] 2017 Wang and Qin [35] Designed an authentication scheme without bilinear pairings Far and Alagheband [15] 2018 Chen et al [32] Proposed a strengthened scheme to alleviate its security risks 3 Wireless Communications and Mobile Computing Kumaravelu et al [14] designed an anonymous scheme which can authenticate both users and HES, with low computational cost.…”

“…In this subsection, we will show that our improved scheme can resist eavesdropping attack, stored set attack, and internal attack. The approaches proposed in literature [15,42,43] are employed in this part. The adversary capabilities are given in Section 3.…”

“…Moreover, the number of parameters transmitted on public channel is minimal, which means our scheme performs better in computing storage. In order to Scheme in [32] Scheme in [33] Scheme in [15] Our scheme 10 Wireless Communications and Mobile Computing show the comparison of execution efficiency more clearly, we show the execution time in μs and parameter numbers in Figure 7. It is obvious to see that our scheme has the shortest execution time under the same conditions.…”

“…In Ref. [15], Far and Alagheband designed a lightweight anonymous authentication protocol. We found that this protocol is suffering from the risk of revealing user's password.…”