An effective key distribution for secure internet pay‐TV using access key hierarchies

Abstract

Distribution of keys in a Conditional Access System takes long computation time because a huge number of keys is to be updated if any user leaves or joins the system. Moreover, it is necessary to send the keys securely to the authorized members. Thus, an effective key distribution protocol for Internet Pay‐TV system is designed in this article to lower the computation time taken to compute the re‐keying information. In the proposed protocol, when the Service Provider needs to refresh a new shared secret key and link values, only a few key updating operations are needed, and they can be achieved using four primary operations, namely, hash function, addition, subtraction, and multiplication. From the experimental results, we perceive that the proposed approach takes less computation cost, communication cost and storage cost compared with other competitive protocols available in the literature. Copyright © 2016 John Wiley & Sons, Ltd.

Self-Healing Group Key Distribution Facilitating Source Authentication Using Block Codes

“…Vijayakumar et al [29] proposed an efficient key distribution scheme for the Internet pay-TV systems, using only simple computations; the Internet pay-TV key distribution schemes are similar to our scenarios where the service providers need to refresh the group keys for a set of dynamic groups of legitimate users, but there are some key differences between the two scenarios: (1) there is only one message source (the service provider) in the Internet pay-TV key distribution schemes; (2) due to the nature of the grouping of the services, the systems usually adopt some kinds of key hierarchy or tree structures to tackle the key distribution. Vijayakumar et al [30] proposed a Chinese Remainder eory-based distributed group key management scheme which supports the dynamic membership change for the unstructured peer-to-peer networks; the scheme reduces the computational complexity in each user side by slightly increasing the storage space of the peer users.…”

“…From the summarized table, we find that, even though all these schemes tackle the group key distribution challenges, the supported functions and the application scenarios of them are quite different; the differences in the application scenarios affect the design, the security properties, and the models very much. For example, the scheme [29] is designed for the pay-TV system where the group key updating is triggered by both its membership change and its subscription change, while the key updating of most of other schemes being triggered periodically or being triggered by membership change; the scenario also motivates its design of the hierarchical key structure; it does not need to consider the source authentication since there is only one message source in the pay-TV systems. e scheme [30] is designed for the P2P networks, where the group key management is partially distributed; even though the scheme might seem computationally efficient, we notice that the number of group member is predetermined, the number affects the initial public parameters, and the size of one single encryption expands linearly as the number increases.…”

“…In this paper, we focus on those systems which support flexible authorized group expression and flexible memberrevoking condition, and a revoked-member could rejoin the system at a later session because such kinds of systems have wider application scenarios and have greater practical application potentials. e schemes [26,27,29,31,32] and our scheme have these flexible functions. Among the schemes, only our scheme provides the source authentication, which is very important in many applications.…”

AMOUN: Asymmetric lightweight cryptographic scheme for wireless group communication

“…Recently, multi-party communication is experiencing a significant surge in research interest due to the massive growth of its applications [1], [2], [3]. In the presence of adversaries and the possibility of illicit cooperation between two or more group members, also known as collusion, and in the absence of preestablished trust for group keys in highly dynamic networks, securing multi-party communication becomes very challenging.…”

“…Multi-recipient cryptography, a key enabler for MSC, is required to set up secure channels for the data exchange in different types of end-user applications [1], [2], [3]. It is also needed for securing key management including key establishment and key exchange between sender and receiving group in a highly dynamic networks, such as vehicular ad hoc networks (VANETs) and wireless sensor networks (WSNs) [6], [7].…”