A secure authentication scheme with provable correctness for pay‐TV systems. Issue 11 (4th February 2016)

• Record Type: Journal Article
• Authors: Wu, Hsiao‐Ling; Chang, Chin‐Chen; Sun, Chin‐Yu
• Is Part Of: Security and communication networks. Volume 9:Issue 11(2016)
• Page Start: 1577
• Page End: 1588
• Publication Date: 2016-02-04
• Subjects: pay‐TV -- Chebyshev chaotic maps -- mutual authentication -- key agreement -- BAN logic; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1449
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract: 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. Copyright © 2016 John Wiley & Sons, Ltd. Abstract : A pay‐television (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, with stands 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.