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 ’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.
Encryption-based schemes are most practical classification. This category neither heavy nor light. Thus, are not suitable for weak devices. For example, Yang J-H and Chang proposed @math -based scheme on @math crypto system for remote user authentication @cite_36 . It has some drawbacks such as vulnerability to insider and impersonation attacks @cite_23 . In the hash-based pay-TV system (the next category), we describe Chen's scheme @cite_23 and then analyse it in the section @math . In @math Arshad proposed an efficient scheme @cite_27 based on Wang's scheme @cite_28 . But, there is no bilinear pairing functions and Arshad's scheme is easy to implement on @math boards.
@cite_36 @cite_27 @cite_28 @cite_23
1966132871 2599428917 2023924043 2044714309
Recently, remote user authentication schemes are implemented on elliptic curve cryptosystem (ECC) to reduce the computation loads for mobile devices. However, most remote user authentication schemes on ECC are based on public-key cryptosystem, in which the public key in the system requires the associated certificate to prove its validity. Thus, the user needs to perform additional computations to verify the certificate in these schemes. In addition, we find these schemes do not provide mutual authentication or a session key agreement between the user and the remote server. Therefore, we propose an ID-based remote mutual authentication with key agreement scheme on ECC in this paper. Based upon the ID-based concept, the proposed scheme does not require public keys for users such that the additional computations for certificates can be reduced. Moreover, the proposed scheme not only provides mutual authentication but also supports a session key agreement between the user and the server. Compared with the related works, the proposed scheme is more efficient and practical for mobile devices. Summary A mobile pay-TV service is one of the ongoing services of multimedia systems. Designing an efficient mechanism for authentication and key distribution is an important security requirement in mobile pay-TV systems. Until now, many security protocols have been proposed for mobile pay-TV systems. However, the existing protocols for mobile pay-TV systems are vulnerable to various security attacks. Recently, Wang and Qin proposed an authentication scheme for mobile pay-TV systems using bilinear pairing on elliptic curve cryptography. They claimed that their scheme could withstand various attacks. In this paper, we demonstrate that Wang and Qin's scheme is vulnerable to replay attacks and impersonation attacks. Furthermore, we propose a novel security protocol for mobile pay-TV systems using the elliptic curve cryptosystem to overcome the weaknesses of Wang and Qin's scheme. In order to improve the efficiency, the proposed scheme is designed in such a way that needs fewer scalar multiplication operations and does not use bilinear pairing, which is an expensive cryptographic operation. Detailed analyses, including verification using the Automated Validation of Internet Security Protocols and Applications tool and implementation on FPGA, demonstrate that the proposed scheme not only withstands active and passive attacks and provides user anonymity but also has a better performance than Wang and Qin's scheme. Mutual authentication is important in a mobile pay-TV system. Traditional authentication schemes make use of one-to-one delivery, that is, one authentication message per request is delivered from a head-end system to subscriber. This delivery occupies too much bandwidth and therefore is inefficient and costly. One-to-many authentication scheme for access control in mobile pay-TV systems was proposed by in 2009. In one-to-many authentication scheme, only one authentication message for multiple requests is broadcasted from the head-end system (HES) to subscribers. claimed that their scheme is secure and provides anonymous authentication for protecting user privacy. However, the authors demonstrate that their scheme has a critical weakness. An attacker without any secret information can not only successfully impersonate mobile set (MS) to cheat the HES but also impersonate HES to cheat MS. The authors result is important for security engineers who design and develop user authentication systems. Afterwards, the authors design a novel one-to-many authentication scheme from bilinear pairings. They give the formal security proof in the random oracle model. In addition, they present the performance analysis of our scheme. The analysis results showed that their novel authentication scheme has shorter transmission message and can be applied in the environment which has limited bandwidth. At the same time, their scheme is also the first secure one-to-many authentication scheme for access control in pay-TV systems. In terms of convenience requirements, mobility has been one of the most important services for pay-TV systems. In 2009, Yang and Chang proposed an authentication protocol for mobile devices using elliptic curves cryptography (ECC) and claimed that their mechanism is secure and efficient using in mobile pay-TV systems. In this paper, we demonstrate that their protocol still is insecure for authentication without password protection and performs inefficiently. Therefore, we offer an anonymous authentication protocol (AAP) to solve the performance issue and insecure risks. In addition, we present an analysis of our protocol to show that our protocol suits better for applications with higher security requirements and low power-consuming devices.