One-to-many authentication for access control in mobile pay-TV systems

作     者：Debiao HE Neeraj KUMAR Han SHEN Jong-Hyouk LEE 

作者机构：State Key Laboratory of Software Engineering Computer School Wuhan University Fujian Provincial Key Laboratory of Network Security and CryptologyFujian Normal University Department of Computer Science and Engineering Thapar University Department of Computer Science and Engineering Sangmyung University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2016年第59卷第5期

页      面：118-132页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the National Natural Science Foundation of China (Grant Nos. 61373169, 61572379, 61501333) National High Technology Research and Development Program of China (863 Program) (Grant No. 2015AA016004) Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund through Fujian Normal University (Grant No. 15011) Natural Science Foundation of Hubei Province of China (Grant No. 2015CFB257) supported by Basic Science Research Program and Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant Nos. NRF-2014R1A1A1006770, NRF-2014M3C4A7030648) 

主　　题：authentication bilinear pairing conditional access system mobile pay-TV 

摘      要：In traditional authentication schemes for access control in mobile pay-TV systems, one-to-one delivery is used, i.e., one authentication message per request is delivered from a head-end system(HES) to a subscriber. The performance of one-to-one delivery for authentication is not satisfactory as it requires frequent operations which results in high bandwidth consumption. To address this issue, one-to-many authentication for access control in mobile pay-TV systems was developed. It requires only one broadcasted authentication message from a HES to subscribers if there are many requests for the same service in a short period of time.However, later it was revealed that the one-to-many authentication scheme was vulnerable to an impersonation attack, i.e., an attacker without any secret key could not only impersonate the mobile set(MS) to the HES but also impersonate the HES to the MS. Then, a new scheme has been recently introduced for secure operations of one-to-many authentication. However, as shown in this paper, the recent work for one-to-many authentication is still vulnerable to the impersonation attack. To mitigate this attack, in this paper, a new scheme for one-tomany authentication using bilinear pairing is proposed that eliminates security weaknesses in the previous work.Results obtained depict that the new improved scheme in this paper provides better performance in terms of computation and communication overheads.