Vijayakumar Pandi - Academia.edu (original) (raw)

Uploads

Papers by Vijayakumar Pandi

Research paper thumbnail of Rotation based secure multicast key management for batch rekeying operations

Many emerging security-rich network applications such as pay-per-view, video broadcasting, video ... more Many emerging security-rich network applications such as pay-per-view, video broadcasting,
video on demand and videoconferencing are based on multicast communication. Thus, securing
multicast communications is an important Internet design issue in most of the network applications.
In such a scenario providing high security for multicast group members using a common group key is
a challenging task. Most of the previous literature describes key tree approaches to distribute the
multicast group key in which the rekeying cost is high for batch joining or leaving operations. The
marking algorithms proposed in the past focus on batch join and batch leave requests. However,
merging and batch balanced algorithms consider batch join more and do not focus much on batch
leave operations. In this paper, we present rotation based key tree algorithms to make the tree
balanced even when batch leave requests are more than batch joins operations. These proposed
algorithms not only maintain a balanced key tree, but also reduce the rekeying costs in comparison with
the existing algorithms when batch leave operation is higher than batch join operation (JM < LM).
Our simulation result shows that this proposed scheme reduces 20% 30% rekeying cost compared to
the existing approaches.

Research paper thumbnail of An intelligent temporal pattern classification system using fuzzy temporal rules and particle swarm optimization

In this paper, we propose a new pattern classification system by combining Temporal features with... more In this paper, we propose a new pattern classification system by combining
Temporal features with Fuzzy Min–Max (TFMM) neural network based classifier
for effective decision support in medical diagnosis. Moreover, a Particle Swarm Optimization
(PSO) algorithm based rule extractor is also proposed in this work for
improving the detection accuracy. Intelligent fuzzy rules are extracted from the temporal
features with Fuzzy Min–Max neural network based classifier, and then PSO
rule extractor is used to minimize the number of features in the extracted rules. We
empirically evaluated the effectiveness of the proposed TFMM-PSO system using the
UCI Machine Learning Repository Data Set. The results are analysed and compared
with other published results. In addition, the detection accuracy is validated by using
the ten-fold cross validation.

Research paper thumbnail of Computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication

Secure multimedia multicast applications involve group communications where group membership requ... more Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

Research paper thumbnail of Centralized key distribution protocol using the greatest common divisor method

Designing a key distribution protocol with minimal computation and storage complexity is a challe... more Designing a key distribution protocol with minimal computation and storage complexity
is a challenging issue in secure multimedia multicast. In most of the multimedia
multicast applications, the group membership requires secured dynamic key generation
and updation operations that usually consume much of the computation time. In this paper,
we propose a new GCD (Greatest Common Divisor) based Key Distribution Protocol which
focuses on two dimensions. The first dimension deals with the reduction of computation
complexity which is achieved in our protocol by performing fewer multiplication
operations during the key updation process. To optimize the number of multiplication
operations, the existing Karatsuba divide and conquer approach for multiplication is used
in this proposed work. The second dimension aims at reducing the amount of information
stored in the Group Center and group members while performing the update operation in
the key content. The proposed algorithm which focuses on these two dimensions has been
implemented and tested using a Cluster tree based key management scheme and has been
found to produce promising results. Comparative analysis to illustrate the performance of
various key distribution protocols is shown in this paper and it has been observed that this
proposed algorithm reduces the computation and storage complexity significantly.

Research paper thumbnail of Optical and physical characteristics of Bay of Bengal aerosols during W-ICARB: Spatial and vertical heterogeneities in the marine atmospheric boundary layer and in the vertical column

Journal of Geophysical Research, 2010

... K. Narasimhulu. Department of Physics, Sri Krishnadevaraya University, Anantapur, India. CBS ... more ... K. Narasimhulu. Department of Physics, Sri Krishnadevaraya University, Anantapur, India. CBS Dutt. ISRO Head Quarters, Bangalore, India. Vijayakumar S. Nair. Space Physics Laboratory, Vikram Sarabhai Space Centre, Trivandrum, India. ...

Research paper thumbnail of Published in IET Information Security Chinese remainder Theorem based centralised group key management for secure multicast communication

Designing a centralised group key management with minimal computation complexity to support dynam... more Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O(1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.

Research paper thumbnail of IFS-2012-0352 (1)

Designing a centralised group key management with minimal computation complexity to support dynam... more Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O(1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.

Research paper thumbnail of Rotation based secure multicast key management for batch rekeying operations

Many emerging security-rich network applications such as pay-per-view, video broadcasting, video ... more Many emerging security-rich network applications such as pay-per-view, video broadcasting,
video on demand and videoconferencing are based on multicast communication. Thus, securing
multicast communications is an important Internet design issue in most of the network applications.
In such a scenario providing high security for multicast group members using a common group key is
a challenging task. Most of the previous literature describes key tree approaches to distribute the
multicast group key in which the rekeying cost is high for batch joining or leaving operations. The
marking algorithms proposed in the past focus on batch join and batch leave requests. However,
merging and batch balanced algorithms consider batch join more and do not focus much on batch
leave operations. In this paper, we present rotation based key tree algorithms to make the tree
balanced even when batch leave requests are more than batch joins operations. These proposed
algorithms not only maintain a balanced key tree, but also reduce the rekeying costs in comparison with
the existing algorithms when batch leave operation is higher than batch join operation (JM < LM).
Our simulation result shows that this proposed scheme reduces 20% 30% rekeying cost compared to
the existing approaches.

Research paper thumbnail of An intelligent temporal pattern classification system using fuzzy temporal rules and particle swarm optimization

In this paper, we propose a new pattern classification system by combining Temporal features with... more In this paper, we propose a new pattern classification system by combining
Temporal features with Fuzzy Min–Max (TFMM) neural network based classifier
for effective decision support in medical diagnosis. Moreover, a Particle Swarm Optimization
(PSO) algorithm based rule extractor is also proposed in this work for
improving the detection accuracy. Intelligent fuzzy rules are extracted from the temporal
features with Fuzzy Min–Max neural network based classifier, and then PSO
rule extractor is used to minimize the number of features in the extracted rules. We
empirically evaluated the effectiveness of the proposed TFMM-PSO system using the
UCI Machine Learning Repository Data Set. The results are analysed and compared
with other published results. In addition, the detection accuracy is validated by using
the ten-fold cross validation.

Research paper thumbnail of Computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication

Secure multimedia multicast applications involve group communications where group membership requ... more Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

Research paper thumbnail of Centralized key distribution protocol using the greatest common divisor method

Designing a key distribution protocol with minimal computation and storage complexity is a challe... more Designing a key distribution protocol with minimal computation and storage complexity
is a challenging issue in secure multimedia multicast. In most of the multimedia
multicast applications, the group membership requires secured dynamic key generation
and updation operations that usually consume much of the computation time. In this paper,
we propose a new GCD (Greatest Common Divisor) based Key Distribution Protocol which
focuses on two dimensions. The first dimension deals with the reduction of computation
complexity which is achieved in our protocol by performing fewer multiplication
operations during the key updation process. To optimize the number of multiplication
operations, the existing Karatsuba divide and conquer approach for multiplication is used
in this proposed work. The second dimension aims at reducing the amount of information
stored in the Group Center and group members while performing the update operation in
the key content. The proposed algorithm which focuses on these two dimensions has been
implemented and tested using a Cluster tree based key management scheme and has been
found to produce promising results. Comparative analysis to illustrate the performance of
various key distribution protocols is shown in this paper and it has been observed that this
proposed algorithm reduces the computation and storage complexity significantly.

Research paper thumbnail of Optical and physical characteristics of Bay of Bengal aerosols during W-ICARB: Spatial and vertical heterogeneities in the marine atmospheric boundary layer and in the vertical column

Journal of Geophysical Research, 2010

... K. Narasimhulu. Department of Physics, Sri Krishnadevaraya University, Anantapur, India. CBS ... more ... K. Narasimhulu. Department of Physics, Sri Krishnadevaraya University, Anantapur, India. CBS Dutt. ISRO Head Quarters, Bangalore, India. Vijayakumar S. Nair. Space Physics Laboratory, Vikram Sarabhai Space Centre, Trivandrum, India. ...

Research paper thumbnail of Published in IET Information Security Chinese remainder Theorem based centralised group key management for secure multicast communication

Designing a centralised group key management with minimal computation complexity to support dynam... more Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O(1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.

Research paper thumbnail of IFS-2012-0352 (1)

Designing a centralised group key management with minimal computation complexity to support dynam... more Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O(1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.