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.
The emerging wireless and mobile networks have extended electronic commerce to another research and application subject: mobile commerce. This creates new opportunities for customers to conduct business from any location at any time. One of the important uses of mobile applications is transforming the mobile phone into a mobile wallet with digital cash that supports both anonymity (as real cash) and security [3]. Hence, in this article we propose a scheme to support m-commerce transactions and provide fully anonymity for mobile users. Our scheme is based on 160 bit ECC, Whose security intensity is equal to 1024 bit RSA. The paper describes the model, infrastructure and details of the protocol. It also discusses the applying ECC on protocol, some implementation issues and restrictions in mobile payment systems. 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. 