Krishnan Kumar

Efficient Region -Based Group Key Agreement Protocol for Ad Hoc Networks using Elliptic Curve Cryptography

A Group Key Agreement (GKA) protocol is a mechanism to establish a cryptographic key for a group of participants, based on each ones contribution, over a public network. Security of various group-oriented applications for ad-hoc groups requires a group secret shared between all participants. In ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increased in e overhead during messaging for topology maintenance, the region based schemes of ad hoc networks therefore aim at handling topology maintenance, managing node movement and reducing overhead. When the group composition changes, group controller can employ supplementary GKA protocols to derive a new key. Thus, they are well-suited to the key establishment needs of dynamic peer-to-peer networks as in ad hoc networks. While many of the proposed GKA protocols are too expensive to be employed by the constrained devices often present in ad hoc networks, others lack a formal security analysis. In this paper, a simple, secure and efficient Region Based GKA protocol using Elliptic Curve Cryptography well suited to dynamic ad hoc networks is presented. This paper introduces a Region-Based contributory group key agreement that achieves the performance lower bound by utilizing a novel Group Elliptic Curve Diffie-Hellman (GECDH) protocol and Tree-based Group Elliptic Curve Diffle-Hellman (TGECDH) protocol, called GEDH & TGECDH protocol. Both theoretical and simulation studies shows that the proposed scheme achieves much lower communication, computation and memory cost than the existing Group Diffie-Hellman and Tree based contributory group key agreement schemes.

A survey on named data networking

Named Data Networking (NDN) is an entirely new internet architecture inspired by years of empirical research into network usage. NDN is related to Content Centric Networking. Unique feature of NDN is its adaptive forwarding plane. In NDN, the packets carry the data name instead of the source and destination address. In NDN, communication takes place by the exchange of Interest and Data packets. Data consumers send Interest packets in the form of names. Routers forward the Interest packet based on the data name and also maintain the state information of pending Interests that enable NDN routers to detect loops, measure performance of different path, quickly detect failures and retry alternative path. The producer replies with data packet that takes the reverse path of Interests. In this paper the motivation and the vision of NDN architecture, and basic components and operations of NDN are described. Also the strength and weakness of NDN are reviewed. The final discussion aims to identify challenges and some future directions for NDN deployment.

Multilevel access control in defense messaging system using Elliptic curve cryptography

Instant messaging technology is the primary mechanism for information sharing and has been the force of success of all social networking sites. Taking this clue, government and military organizations have also started using messaging for quick and fast actions. Defense messaging system takes a message and forwards it to the intending recipients or parties based on the message criteria for immediate action. This system should provide security assurance and should be manageable by central administrative authority instead of relying on the individual users. The primary goal of this research is to develop a multilevel access control for Defense messaging system using Elliptic curve cryptography. The system developed is secure, multi site and allows for global communication using the inherent properties of Elliptic Curve cryptography. Elliptic Curve cryptography provides a greater security with less bit size and it is fast when compared to other schemes. The implementation suggests that it is a secure system which occupies fewer bits and can be used for low power devices.

A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks Using Elliptic Curve Cryptography

This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group; hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.

Design and Implementation of Multilevel Access Control in Synchronized Audio to Audio Steganography Using Symmetric Polynomial Scheme

Steganography techniques are used in Multimedia data transfer to prevent adversaries from eaves dropping. Synchronized audio to audio steganography deals with recording the secret audio, hiding it in another audio file and subsequently sending to multiple receivers. This paper proposes a Multilevel Access control in Synchronized audio steganography, so that Audio files which are meant for the users of low level class can be listened by higher level users, whereas the vice-versa is not allowed. To provide multilevel access control, symmetric polynomial based scheme is used. The steganography scheme makes it possible to hide the audio in different bit locations of host media without inviting suspicion. The Secret file is embedded in a cover media with a key. At the receiving end the key can be derived by all the classes which are higher in the hierarchy using symmetric polynomial and the audio file is played. The system is implemented and found to be secure, fast and scalable. Simulation results show that the system is dynamic in nature and allows any type of hierarchy. The proposed approach is better even during frequent member joins and leaves. The computation cost is reduced as the same algorithm is used for key computation and descendant key derivation. Steganography technique used in this paper does not use the conventional LSB’s and uses two bit positions and the hidden data occurs only from a frame which is dictated by the key that is used. Hence the quality of stego data is improved.

A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks

A group key agreement (GKA) protocol is a mechanism to establish a cryptographic key for a group of participants, based on each one’s contribution, over a public network. In ad-hoc networks, the movement of the nodes may quickly change the topology resulting in the increased overhead during messaging for topology maintenance. The Region-based schemes of ad-hoc networks, aim of handling topology maintenance, managing node movement and reducing overhead. In this paper, a simple, secure and efficient Region-based GKA protocol using CRTDH&TGDH well suited to dynamic ad-hoc networks is presented and also introduces a region-based contributory group key agreement that achieves the performance lower bound by utilizing a novel CRTDH and TGDH protocol called CRTDH&TGDH protocol. Both theoretical and experimental results show that the proposed scheme achieves communication, computation and memory cost is lower than the existing group key agreement schemes.

A Secure Ubiquitous Computing Approach for Serving Elderly Citizens

Health and mobility of elderly people is becoming a more and more important issue in Indian’s ageing societies. New communication-based methods to provide health service with personal health care devices and services are considered promising elements of best medical care for everybody. Among all services a system that can help people living with very less support or care takers around them is essential. To achieve this vision, several technological issues have to be solved: (i) body sensors to monitor vital functions like ECG, BP and Body Temperature have to be developed; (ii) the collected sensor data has to be analyzed to detect emergency situations; (iii) relevant data has to be integrated with other information systems in the work environment of medical experts; (iv) information has to be send in secure way using Elliptic Curve Cryptography. These challenges are addressed within the Ubiquitous Health Care System. The goal of the paper is to develop a framework in which health professionals can remotely monitor and diagnose elderly person or patients.

A Novel Approach towards Multilevel Access Control for Secure Group Communication Using Symmetric Polynomial Based Elliptic Curve Cryptography

This paper addresses an interesting security problem in communication networks: Multilevel Access control for secure group communication. Multilevel access control allows members belonging to a higher level hierarchy to see the message transfers going on between the users who are under their control . This type of scenario is very common in corporate organizations and also in government agencies like defense. For this, two things are needed i) a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group ii) It should be possible for the ancestors of a group to derive the group key of the descendants node whereas the vice versa is not allowed . In this paper, We propose a novel, secure, scalable and efficient Symmetric Polynomial Based Elliptic Curve Cryptographic protocol (SPECC) for communication networks. This is implemented by having the central authority to have a secret polynomial distributed among the different groups. The symmetric polynomial value is not an ordinary value but, it in fact represents points in an elliptic curve. Using this point the message transfer takes place among the group members. The higher level group members are able to derive the group key of the lower level users by applying the symmetric polynomial scheme. To avoid congestion a node acts as a group controller for a group which calculates group key to pass on to the group members of the group . The ancestral group controllers derive the group keys and pass it on to the group members to enable them to see the messages. Using this approach, messages and key updates will be limited within subgroup and outer group. Hence computation load is distributed among many hosts. Both theoretical analysis and experimental results show that SPECC performs better for the Multilevel Access Control problem in terms of security, memory cost, computation cost and communication cost.

Software-defined networking: Reconfigurable network systems in LAN topology

An emerging technology of SDN plays a vital role in network reconfiguration. In an existing system, real word experiment on dynamic changing network topology lacks the ability to change the network configuration. The article works for dynamic reconfiguration in networking through high-level programmability via such C++ or python via SDN controller. In this paper, SDN enable an innovation performance for improving the network reconfigurability through three resources such as controller (Raspberry pi), switch and host nodes. The protocol of Openflow acts as an interface between controller and switch. As a result, the dynamic network reconfigurability solves the problem of manual configuration and reconfiguration to the network operator where the system deploys on campus network.

Cost effective region-based group key agreement protocol for ad hoc networks using elliptic curve cryptography

This paper addresses an interesting security problem in wireless ad hoc networks: the Dynamic Group Key Agreement key establishment. For secure group communication in an Ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient Region-Based Group Key Agreement protocol for ad-hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using Group Elliptic Curve Diffie-Hellman (GECDH) Protocol and links with other subgroups in a Tree structure using Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group. Hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key agreement problem in Ad Hoc network in terms of memory cost, computation cost and communication cost.