4.6 Article

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

Journal

SCIENCE CHINA-INFORMATION SCIENCES
Volume 59, Issue 5, Pages -

Publisher

SCIENCE PRESS
DOI: 10.1007/s11432-015-5469-5

Keywords

authentication; bilinear pairing; conditional access system; mobile pay-TV

Funding

  1. National Natural Science Foundation of China [61373169, 61572379, 61501333]
  2. National High Technology Research and Development Program of China (863 Program) [2015AA016004]
  3. Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund through Fujian Normal University [15011]
  4. Natural Science Foundation of Hubei Province of China [2015CFB257]
  5. Basic Science Research Program and Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) - Ministry of Science, ICT and Future Planning [NRF-2014R1A1A1006770, NRF-2014M3C4A7030648]
  6. National Research Foundation of Korea [2014R1A1A1006770] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

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-to many 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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available