A Computationally Efficient and Scalable Key Management Scheme for Access Control of Media Delivery in Digital Pay-TV Systems

Kumar, Vinod; Kumar, Rajendra; Pandey, Santosh

doi:10.1007/s11042-020-08904-8

Cited by 68 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tysowski et al 20 proposed a GKM scheme based on proxy re‐encryption in cloud deployment. Vijayakumar et al 21 (as well as Kumar et al 22 ) presented a dual group‐based scheme using the Chinese remainder theorem (CRT) in vehicular ad‐hoc networks along with the fingerprint authentication of vehicles. This scheme is claimed to be efficient for computational cost in dual key management.…”

Section: Related Workmentioning

confidence: 99%

EPREKM: ElGamal proxy re‐encryption‐based key management scheme with constant rekeying cost and linear public bulletin size

Sharma,

B. R.

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryA vast body of literature is filled with many key management schemes constructed using different cryptographic primitives. They aim toward either security goals or improvement in performance efficiency. However, the key management schemes based on proxy re‐encryption suffer from massive communication and computational costs. We propose an ElGamal proxy re‐encryption‐based construction for the key management scheme to resolve this. The proposed scheme involves constant computational and communication costs in rekeying operations and linear public bulletin size. We achieve essential security requirements of forward and backward secrecy in this scheme. The scheme is also secure against the collusion attack. In addition, we address the importance of adequately managing missed rekeying updates for offline users. The existing schemes trivially keep track of each rekeying message on the public bulletin board, which increases the size of the public bulletin with every join/leave operation. However, the proposed scheme uses the public bulletin board so that the handling of offline users is built into the scheme itself, which manages it efficiently. Also, the public bulletin size in the proposed scheme is not dependent on the number of rekeying operations but linear in the number of users.

show abstract

Section: Related Workmentioning

confidence: 99%

EPREKM: ElGamal proxy re‐encryption‐based key management scheme with constant rekeying cost and linear public bulletin size

Sharma,

B. R.

2024

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The group key management is two types such as key agreement and key distribution. In key agreement, all nodes in the group calculate a public key utilizing certain public limits 6,7 . An integrated ability and reliable third party occurs in key distribution, to allocate group keys to all nodes.…”

Section: Introductionmentioning

confidence: 99%

“…In key agreement, all nodes in the group calculate a public key utilizing certain public limits. 6,7 An integrated ability and reliable third party occurs in key distribution, to allocate group keys to all nodes. Hence, group key agreement is feasible over key distribution for safe communication.…”

Section: Introductionmentioning

confidence: 99%

Enabling security in MANETs using an efficient cluster based group key management with elliptical curve cryptography in consort with sail fish optimization algorithm

Shanmuganathan

Boopalan²,

Elangovan

et al. 2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In MANET, group key management is a vital part of multicast security. But distribution of keys in an authenticated manner is a difficult task in group key management. The existing methods provide low security with high processing time during group key management resulting does not provide sufficient results. Therefore, enabling security in MANETs using an efficient cluster based group key management with elliptical curve cryptography in consort with sail fish optimization algorithm is proposed in this article for two‐level security with reduced computational overhead. At first, all the nodes in the cluster are structured in hierarchy method. The key server creates public key utilizing private key of the group node. Here, elliptical curve cryptography based meta‐heuristic sail fish optimization algorithm is used to select the optimal private key for better secure communication. After selecting this optimum private key, the key server creates the public key, and a common group key is created using this generated public keys. If the nodes joint or exit from the subgroup, the reset process is executed in group key management process. Finally, this process reduces the computational overhead of rekeying method. The proposed method is simulated by Python programming and network simulator‐3. The proposed elliptical curve cryptography based sail fish optimization algorithm attains 10.9%, 22.21%, and 11.43% low computational overhead, 19.34%, 13.45%, and 42.13% low latency, 43.45%, 22.21%, and 12.22% high packet delivery rate, 11.23%, 13.41%, and 21.11% high network life time than the existing methods.

show abstract

Three‐class brain tumor classification from magnetic resonance images using separable convolution based neural network

Isunuri

Kakarla

2021

Concurrency and Computation

View full text Add to dashboard Cite

Summary Brain cancer is one of the deadliest hazards in the world and hence tumor classification became a dominant task in brain tumor diagnosis. There is a wide range of brain tumors, and each tumor exhibits distinct properties like location, shape, size, and texture. Thus, multi‐class brain magnetic resonance (MR) image classification became a trivial task. In this article, we have proposed a seven‐layer convolutional neural network to address three‐class brain MR image classification. We have employed separable convolution to optimize computation time. The proposed separable convolution based neural network model exhibits accuracy of 97.52% on a publicly available dataset consists of 3064 images. The proposed model has analyzed with the help of four key parameters. Our proposed model exhibits superior performance than existing methods in key parameters. Further, our model takes less training time due to sparse network consists of seven layers.

show abstract

A Computationally Efficient and Scalable Key Management Scheme for Access Control of Media Delivery in Digital Pay-TV Systems

Cited by 68 publications

References 28 publications

EPREKM: ElGamal proxy re‐encryption‐based key management scheme with constant rekeying cost and linear public bulletin size

EPREKM: ElGamal proxy re‐encryption‐based key management scheme with constant rekeying cost and linear public bulletin size

Enabling security in MANETs using an efficient cluster based group key management with elliptical curve cryptography in consort with sail fish optimization algorithm

Three‐class brain tumor classification from magnetic resonance images using separable convolution based neural network

Contact Info

Product

Resources

About