In traditional television (TV) systems, users have to pay for all of the channels provided by the TV service server. However, usually, users are not interested in all of the channels, so they waste money by paying for all of the channels. For this reason, the concept of "pay-TV" has been developed. A pay-TV system allows the subscribers to pay for the specific channels they want to watch. If we consider that m users subscribe to n channels in traditional schemes for pay-TV, the time complexity will be O(mn). It is lower efficiency for user on the pay-TV system. But, in this paper, we proposed a novel authentication scheme for pay-TV systems based on Chebyshev chaotic maps, and the time complexity only needs O(m). The purpose of our scheme is focus on efficiency and security. The security and performance analyses showed that our proposed scheme satisfies the essential functionality requirements, withstands potential attacks, and is suitable for real-world practical implementation. Furthermore, the Burrows-Abadi-Needham logic model was used to prove the correctness of our proposed scheme for the mutual authentication between users and the server.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.