call for papers, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJEI, call for papers 2012,journal of science and technolog
This document summarizes a research paper that proposes a novel approach for distributing symmetric keys securely and efficiently in dynamic multicast networks. The approach uses Maximum Distance Separable (MDS) error control codes to encode session keys, which significantly reduces the computational complexity of key distribution compared to existing encryption-based schemes. Specifically, the MDS codes allow a central group controller to encode session keys and distribute the encoded keys to members, who can then efficiently decode the session keys using the MDS properties. This provides lower computation complexity while maintaining low communication and storage complexity for secure dynamic multicast key distribution.
EFFECTIVE KEY GENERATION FOR MULTIMEDIA AND WEB APPLICATIONijiert bestjournal
The Effective Key Generation for Multimedia and Web Application is used as the core
component of many web and multimedia applications such as pay-TV, teleconferencing,
real-time distribution of stock market price and etc. The main challenges for secure multicast
are scalability, efficiency and authenticity. In this project, we propose a scalable, efficient,
authenticated group key agreement scheme for large and dynamic multicast systems. The
proposed key agreement scheme is identity-based which uses the bilinear map over the
elliptic curves. Compared with the existing system, the proposed system provides group
member authenticity without imposing extra mechanism. Furthermore, we give a scalability
solution based on the subgroups, which has advantages over the existing schemes. Security
analysis shows that our scheme satisfies both forward secrecy and backward secrecy.
A Comparative Study of Group Key Management in MANETIJERA Editor
A Mobile Ad-Hoc Network (MANET) is a self organized network, with no fixed infrastructure, limited
resources and limited physical security. Security in such an environment is an essential requirement. Key
management is a salient element in MANET security. It is responsible for key generation, storage, distribution,
updating, revocation, deleting, and archiving. Key management protocols are classified into symmetric,
asymmetric, group, and hybrid. Group key management is a point of interest for researchers with the growing
usage of mobile devices and the rising of multicast communication. This paper surveys different approaches in
group key management schemes. A comparative study is demonstrated in terms of reliability, computational
complexity, storage cost, communication overheads, pre-requirements, security levels, robustness,
vulnerabilities, scalability, energy and mobility. Finally, the study concludes the pros and cons of each protocol.
A Novel Key Management Paradigm for Broadcasting to Remote Cooperative GroupsIJMER
A Mobile Ad Hoc Network(MANET) is a system made up of wireless mobile nodes. These
MANET nodes have wireless communication and networking characteristics. MANETs have been
proposed to serve as an effective networking system facilitating information exchange between mobile
devices even without fixed infrastructures. In MANETs, it is important to support group-oriented
applications, such as audio/video conference and one-to-many data dissemination in disaster or
battlefield rescue scenarios. In the above group oriented communication scenarios, the common problem
is to enable a sender to securely transmit secret messages to a remote cooperative group. A solution to
the above problem must meet several constraints. First, the sender must be remote and can be dynamic.
Second, the message transmission may cross various networks including open insecure networks before
reaching the intended recipients. Third, the data communication from the group members to the sender
may be limited. Also, the sender may wish to choose only a subset of the overall group as the intended
recipients. Furthermore, it is hard to resort to a fully trusted third party to secure the overall
communication. In contrast to the above constraints, mitigating features are that the group members are
cooperative and the secret communication among them is local and efficient. This paper exploits these
mitigating features to facilitate the remote access control of group-oriented communications without
relying on a fully trusted secret key generation center.
EFFECTIVE KEY GENERATION FOR MULTIMEDIA AND WEB APPLICATIONijiert bestjournal
The Effective Key Generation for Multimedia and Web Application is used as the core
component of many web and multimedia applications such as pay-TV, teleconferencing,
real-time distribution of stock market price and etc. The main challenges for secure multicast
are scalability, efficiency and authenticity. In this project, we propose a scalable, efficient,
authenticated group key agreement scheme for large and dynamic multicast systems. The
proposed key agreement scheme is identity-based which uses the bilinear map over the
elliptic curves. Compared with the existing system, the proposed system provides group
member authenticity without imposing extra mechanism. Furthermore, we give a scalability
solution based on the subgroups, which has advantages over the existing schemes. Security
analysis shows that our scheme satisfies both forward secrecy and backward secrecy.
A Comparative Study of Group Key Management in MANETIJERA Editor
A Mobile Ad-Hoc Network (MANET) is a self organized network, with no fixed infrastructure, limited
resources and limited physical security. Security in such an environment is an essential requirement. Key
management is a salient element in MANET security. It is responsible for key generation, storage, distribution,
updating, revocation, deleting, and archiving. Key management protocols are classified into symmetric,
asymmetric, group, and hybrid. Group key management is a point of interest for researchers with the growing
usage of mobile devices and the rising of multicast communication. This paper surveys different approaches in
group key management schemes. A comparative study is demonstrated in terms of reliability, computational
complexity, storage cost, communication overheads, pre-requirements, security levels, robustness,
vulnerabilities, scalability, energy and mobility. Finally, the study concludes the pros and cons of each protocol.
A Novel Key Management Paradigm for Broadcasting to Remote Cooperative GroupsIJMER
A Mobile Ad Hoc Network(MANET) is a system made up of wireless mobile nodes. These
MANET nodes have wireless communication and networking characteristics. MANETs have been
proposed to serve as an effective networking system facilitating information exchange between mobile
devices even without fixed infrastructures. In MANETs, it is important to support group-oriented
applications, such as audio/video conference and one-to-many data dissemination in disaster or
battlefield rescue scenarios. In the above group oriented communication scenarios, the common problem
is to enable a sender to securely transmit secret messages to a remote cooperative group. A solution to
the above problem must meet several constraints. First, the sender must be remote and can be dynamic.
Second, the message transmission may cross various networks including open insecure networks before
reaching the intended recipients. Third, the data communication from the group members to the sender
may be limited. Also, the sender may wish to choose only a subset of the overall group as the intended
recipients. Furthermore, it is hard to resort to a fully trusted third party to secure the overall
communication. In contrast to the above constraints, mitigating features are that the group members are
cooperative and the secret communication among them is local and efficient. This paper exploits these
mitigating features to facilitate the remote access control of group-oriented communications without
relying on a fully trusted secret key generation center.
Securing cluster based adhoc network through balanced clustering with distrib...eSAT Journals
Abstract In this paper, we address key management in cluster-based mobile ad hoc networks (MANETs). We present a fully-distributed ID-based multiple secrets key management scheme (IMKM). This scheme is implemented via a combination of ID-based multiple secrets and threshold cryptography. Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. Our proposed analysis includes the effect of packet generation model, random deployment of sensors, dynamic cluster head assignment, data compression, and energy consumption model at the sensors. a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP), which pursues energy conservation through balanced clustering, is proposed. Performance evaluation of ECHERP is carried out through simulation tests. We also present a novel key predistribution scheme that uses deployment knowledge to divide deployment regions into overlapping clusters, each of which has its own distinct key space. Through careful construction of these clusters, network resilience is improved, we focus on the management of encryption keys in large-scale clustered WSNs. We propose a novel distributed key management scheme based on Exclusion Basis Systems (EBS); a combinatorial formulation of the group key management problem. Initially, clusters are formed in the network and the cluster heads are selected based on the energy cost, coverage and processing capacity. The sink assigns cluster key to every cluster and an EBS key set to every cluster head. The EBS key set contains the pairwise keys for intra-cluster and inter-cluster communication. During data transmission towards the sink, the data is made to pass through two phases of encryption thus ensuring security in the network. Our results include performance evaluation in terms of security metrics in clustered WSN and a detailed analysis of resource utilization. Keywords: cluster, deployment knowledge, energy efficiency key predistribution, event-driven, exclusion basis systems, hierarchical routing, ID-based cryptography, key agreement, key management, lifetime, location-aware protocols, mobile ad hoc network, Network coding, , random deployment, Security, secret sharing, secret key distribution, sensor networks, volatile environments, Wireless sensor networks secure group communications.
Impact of Mobility for Qos Based Secure Manet graphhoc
Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, energy and power. Several group oriented applications over MANETs create new challenges to routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time. It is necessary to choose a routing protocol which establishes true connectivity between the mobile nodes. The pattern of movement of members is classified into different mobility models and each one has its own distinct features. It is a crucial part in the performance of MANET. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution for mobile adhoc networks. This paper describes the impact of mobility models for the performance of a new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol in terms of QOS requirements such as end to end delay, energy consumption and key delivery ratio. For simulation purposes, three mobility models are considered. Simulation results illustrate the performance of routing protocol with different mobility models and different mobility speed under varying network conditions.
TWO PHASE CLANDESTAIN IMAGE ENCRYPTION acijjournal
In today’s internet world is full of data steals and hackers. So, there is a essential to design a system that
assists the internet users to interchange their secret and private data safely across the web. Informationhiding
process in a Steganography system starts by identifying medium’s redundant bits. The encryption
process creates a stego medium by replacing these redundant bits with data from the hidden message.
So, we propose a method for encrypting the image, which has two phases. In the first phase, Perform
Circular Shift Operations on the image pixels and the number of rotations have been calculated based on
the length of the password. In the second phase, the first phase has undergone some bitwise operations
with a carriage image, by doing this; breaking of the cipher text is difficult.
A METHOD OF TRUST MANAGEMENT IN WIRELESS SENSOR NETWORKSijsptm
The research problem considered in this paper is how to protect wireless sensor networks (WSN) against cyber-threats by applying trust management and how to strengthen network resilience to attacks targeting the trust management mechanism itself. A new method, called WSN Cooperative Trust Management Method (WCT2M), of distributed trust management in multi-layer wireless sensor networks is proposed and its performance is evaluated. The method is specified by giving its class model in UML and by
explaining the related attributes and methods. Different attacks against the network and against WCT2M deployed in the network are considered. The experimental evaluation of WCT2M involves laboratory experiments and simulations using a dedicated simulator. The evaluation focuses on efficiency of detecting and isolating the malicious nodes that implement different attack scenarios in the network and on the
method’s sensitivity to the changes in effectiveness of the security mechanisms deployed in the network nodes.
Elliptic Curve for Secure Group Key Management in Distributed Networkijceronline
Group communication emphasis an important security criterion in the design of a distributed network. All the members of the group must agree to a common session key. The management of this session key refers to the group key management which is based on some group key agreement protocol. In this paper we propose a group key management method for secure group communication in a distributed network. Frequent change in group membership, and managing the key distribution for new members are the two main problems to be faced in group communication that too with minimal computation and communication overhead. Our system uses the concept of Elliptic curve Cryptography that provide same level of security as that of other cryptosysytems with reduced key size. This results in less re-keying and re-distribution operations, thus reducing computation and communication overheads respectively
A Survey of Source Authentication Schemes for Multicast transfer in Adhoc Net...ijsrd.com
An adhoc network is a collection of autonomous nodes with dynamically changing infrastructure. Multicast is a good mechanism for group communication. It can be used in the group oriented applications like video/audio conference, interactive group games, video on demand etc. The security problems obstruct the large deployment of the multicast communication model. Multicast data origin authentication is the main component in the security architecture. The authentication schemes should scalable and efficient against packet loss. In this article we discuss varies authentication scheme for multicast data origin with their advantage and disadvantage
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...IJCNCJournal
In this paper a detailed analysis of Data Encryption Standard (DES), Triple DES (3DES) and Advanced
Encryption Standard (AES) symmetric encryption algorithms in MANET was done using the Network
Simulator 2 (NS-2) in terms of energy consumption, data transfer time, End-to-End delay time and
throughput with varying data sizes. Two simulation models were adopted: the first simulates the network
performance assuming the availability of the common key, and the second simulates the network
performance including the use of the Diffie-Hellman Key Exchange (DHKE) protocol in the key
management phase. The obtained simulation results showed the superiority of AES over DES by 65%, 70%
and 83% in term of the energy consumption, data transfer time, and network throughput respectively. On
the other hand, the results showed that AES is better than 3DES by approximately 90% for all of the
performance metrics. Based on these results the AES was the recommended encryption scheme.
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphert...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
A secure key computation protocol for secure group communication with passwor...csandit
Providing security in group communication is more essential in this new network
environment. Authentication and Confidentiality are the major concerns in secure group
communication. Our proposed approach uses an authenticated group key transfer protocol
that relies on trusted key generation center (KGC). KGC computes group pair for each
individual and transport the pair of values to all group members in a secured manner.
Password based authentication mechanism is used to avoid the illegal member access in a
group Also, the proposed approach facilitates efficient key computation technique such that
only authorized group members will be able to computer and retrieve the secret key and
unauthorized members cannot retrieve the key. The proposed algorithm is more efficient and
relies on NP class. In addition, the distribution of key is also safe and secure. Moreover, the
pair generated for the computation of key is also very strong since the cryptographic
techniques are used which provides efficient computation.
A SECURE KEY COMPUTATION PROTOCOL FOR SECURE GROUP COMMUNICATION WITH PASSWOR...cscpconf
Providing security in group communication is more essential in this new network environment. Authentication and Confidentiality are the major concerns in secure group
communication. Our proposed approach uses an authenticated group key transfer protocol that relies on trusted key generation center (KGC). KGC computes group pair for each
individual and transport the pair of values to all group members in a secured manner. Password based authentication mechanism is used to avoid the illegal member access in a
group Also, the proposed approach facilitates efficient key computation technique such that only authorized group members will be able to computer and retrieve the secret key and unauthorized members cannot retrieve the key. The proposed algorithm is more efficient and relies on NP class. In addition, the distribution of key is also safe and secure. Moreover, the pair generated for the computation of key is also very strong since the cryptographic techniques are used which provides efficient computation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Latest IEEE Projects on All Domains in Computer/ Electronics Engineering
____________________________________________
We develop projects for final year students in computer engineering. These are some topics which are feasible to implement.
For more topics please visit: www.ns2academy.in
Or call us on 9970186685/ 020 24394323
Or mail us: info@ns2academy.in
Hiding message from hacker using novel network techniquesPriyangaRajaram
we address the trouble of selective jamming attacks in wireless networks. In these assaults, the adversary is energetic best for a brief period of time, selectively concentrated on messages of excessive significance. We illustrate the benefits of selective jamming in phrases of network performance degradation and adversary effort with the aid of offering case research. A selective assault on TCP and one on routing. We show that selective jamming attacks can be launched with the aid of performing actual-time packet classification at the physical layer. To mitigate these attacks, we develop 3 schemes that prevent actual-time packet class via combining cryptographic primitives with physical-layer attributes. We analyze the security of our strategies and examine their computational and communication overhead.
Securing cluster based adhoc network through balanced clustering with distrib...eSAT Journals
Abstract In this paper, we address key management in cluster-based mobile ad hoc networks (MANETs). We present a fully-distributed ID-based multiple secrets key management scheme (IMKM). This scheme is implemented via a combination of ID-based multiple secrets and threshold cryptography. Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. Our proposed analysis includes the effect of packet generation model, random deployment of sensors, dynamic cluster head assignment, data compression, and energy consumption model at the sensors. a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP), which pursues energy conservation through balanced clustering, is proposed. Performance evaluation of ECHERP is carried out through simulation tests. We also present a novel key predistribution scheme that uses deployment knowledge to divide deployment regions into overlapping clusters, each of which has its own distinct key space. Through careful construction of these clusters, network resilience is improved, we focus on the management of encryption keys in large-scale clustered WSNs. We propose a novel distributed key management scheme based on Exclusion Basis Systems (EBS); a combinatorial formulation of the group key management problem. Initially, clusters are formed in the network and the cluster heads are selected based on the energy cost, coverage and processing capacity. The sink assigns cluster key to every cluster and an EBS key set to every cluster head. The EBS key set contains the pairwise keys for intra-cluster and inter-cluster communication. During data transmission towards the sink, the data is made to pass through two phases of encryption thus ensuring security in the network. Our results include performance evaluation in terms of security metrics in clustered WSN and a detailed analysis of resource utilization. Keywords: cluster, deployment knowledge, energy efficiency key predistribution, event-driven, exclusion basis systems, hierarchical routing, ID-based cryptography, key agreement, key management, lifetime, location-aware protocols, mobile ad hoc network, Network coding, , random deployment, Security, secret sharing, secret key distribution, sensor networks, volatile environments, Wireless sensor networks secure group communications.
Impact of Mobility for Qos Based Secure Manet graphhoc
Secure multicast communication in Mobile Adhoc Networks (MANETs) is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, energy and power. Several group oriented applications over MANETs create new challenges to routing protocols in terms of QOS requirements. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time. It is necessary to choose a routing protocol which establishes true connectivity between the mobile nodes. The pattern of movement of members is classified into different mobility models and each one has its own distinct features. It is a crucial part in the performance of MANET. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution for mobile adhoc networks. This paper describes the impact of mobility models for the performance of a new cluster-based multicast tree algorithm with destination sequenced distance vector routing protocol in terms of QOS requirements such as end to end delay, energy consumption and key delivery ratio. For simulation purposes, three mobility models are considered. Simulation results illustrate the performance of routing protocol with different mobility models and different mobility speed under varying network conditions.
TWO PHASE CLANDESTAIN IMAGE ENCRYPTION acijjournal
In today’s internet world is full of data steals and hackers. So, there is a essential to design a system that
assists the internet users to interchange their secret and private data safely across the web. Informationhiding
process in a Steganography system starts by identifying medium’s redundant bits. The encryption
process creates a stego medium by replacing these redundant bits with data from the hidden message.
So, we propose a method for encrypting the image, which has two phases. In the first phase, Perform
Circular Shift Operations on the image pixels and the number of rotations have been calculated based on
the length of the password. In the second phase, the first phase has undergone some bitwise operations
with a carriage image, by doing this; breaking of the cipher text is difficult.
A METHOD OF TRUST MANAGEMENT IN WIRELESS SENSOR NETWORKSijsptm
The research problem considered in this paper is how to protect wireless sensor networks (WSN) against cyber-threats by applying trust management and how to strengthen network resilience to attacks targeting the trust management mechanism itself. A new method, called WSN Cooperative Trust Management Method (WCT2M), of distributed trust management in multi-layer wireless sensor networks is proposed and its performance is evaluated. The method is specified by giving its class model in UML and by
explaining the related attributes and methods. Different attacks against the network and against WCT2M deployed in the network are considered. The experimental evaluation of WCT2M involves laboratory experiments and simulations using a dedicated simulator. The evaluation focuses on efficiency of detecting and isolating the malicious nodes that implement different attack scenarios in the network and on the
method’s sensitivity to the changes in effectiveness of the security mechanisms deployed in the network nodes.
Elliptic Curve for Secure Group Key Management in Distributed Networkijceronline
Group communication emphasis an important security criterion in the design of a distributed network. All the members of the group must agree to a common session key. The management of this session key refers to the group key management which is based on some group key agreement protocol. In this paper we propose a group key management method for secure group communication in a distributed network. Frequent change in group membership, and managing the key distribution for new members are the two main problems to be faced in group communication that too with minimal computation and communication overhead. Our system uses the concept of Elliptic curve Cryptography that provide same level of security as that of other cryptosysytems with reduced key size. This results in less re-keying and re-distribution operations, thus reducing computation and communication overheads respectively
A Survey of Source Authentication Schemes for Multicast transfer in Adhoc Net...ijsrd.com
An adhoc network is a collection of autonomous nodes with dynamically changing infrastructure. Multicast is a good mechanism for group communication. It can be used in the group oriented applications like video/audio conference, interactive group games, video on demand etc. The security problems obstruct the large deployment of the multicast communication model. Multicast data origin authentication is the main component in the security architecture. The authentication schemes should scalable and efficient against packet loss. In this article we discuss varies authentication scheme for multicast data origin with their advantage and disadvantage
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...IJCNCJournal
In this paper a detailed analysis of Data Encryption Standard (DES), Triple DES (3DES) and Advanced
Encryption Standard (AES) symmetric encryption algorithms in MANET was done using the Network
Simulator 2 (NS-2) in terms of energy consumption, data transfer time, End-to-End delay time and
throughput with varying data sizes. Two simulation models were adopted: the first simulates the network
performance assuming the availability of the common key, and the second simulates the network
performance including the use of the Diffie-Hellman Key Exchange (DHKE) protocol in the key
management phase. The obtained simulation results showed the superiority of AES over DES by 65%, 70%
and 83% in term of the energy consumption, data transfer time, and network throughput respectively. On
the other hand, the results showed that AES is better than 3DES by approximately 90% for all of the
performance metrics. Based on these results the AES was the recommended encryption scheme.
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphert...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
A secure key computation protocol for secure group communication with passwor...csandit
Providing security in group communication is more essential in this new network
environment. Authentication and Confidentiality are the major concerns in secure group
communication. Our proposed approach uses an authenticated group key transfer protocol
that relies on trusted key generation center (KGC). KGC computes group pair for each
individual and transport the pair of values to all group members in a secured manner.
Password based authentication mechanism is used to avoid the illegal member access in a
group Also, the proposed approach facilitates efficient key computation technique such that
only authorized group members will be able to computer and retrieve the secret key and
unauthorized members cannot retrieve the key. The proposed algorithm is more efficient and
relies on NP class. In addition, the distribution of key is also safe and secure. Moreover, the
pair generated for the computation of key is also very strong since the cryptographic
techniques are used which provides efficient computation.
A SECURE KEY COMPUTATION PROTOCOL FOR SECURE GROUP COMMUNICATION WITH PASSWOR...cscpconf
Providing security in group communication is more essential in this new network environment. Authentication and Confidentiality are the major concerns in secure group
communication. Our proposed approach uses an authenticated group key transfer protocol that relies on trusted key generation center (KGC). KGC computes group pair for each
individual and transport the pair of values to all group members in a secured manner. Password based authentication mechanism is used to avoid the illegal member access in a
group Also, the proposed approach facilitates efficient key computation technique such that only authorized group members will be able to computer and retrieve the secret key and unauthorized members cannot retrieve the key. The proposed algorithm is more efficient and relies on NP class. In addition, the distribution of key is also safe and secure. Moreover, the pair generated for the computation of key is also very strong since the cryptographic techniques are used which provides efficient computation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Latest IEEE Projects on All Domains in Computer/ Electronics Engineering
____________________________________________
We develop projects for final year students in computer engineering. These are some topics which are feasible to implement.
For more topics please visit: www.ns2academy.in
Or call us on 9970186685/ 020 24394323
Or mail us: info@ns2academy.in
Hiding message from hacker using novel network techniquesPriyangaRajaram
we address the trouble of selective jamming attacks in wireless networks. In these assaults, the adversary is energetic best for a brief period of time, selectively concentrated on messages of excessive significance. We illustrate the benefits of selective jamming in phrases of network performance degradation and adversary effort with the aid of offering case research. A selective assault on TCP and one on routing. We show that selective jamming attacks can be launched with the aid of performing actual-time packet classification at the physical layer. To mitigate these attacks, we develop 3 schemes that prevent actual-time packet class via combining cryptographic primitives with physical-layer attributes. We analyze the security of our strategies and examine their computational and communication overhead.
Computer Science
Active and Programmable Networks
Active safety systems
Ad Hoc & Sensor Network
Ad hoc networks for pervasive communications
Adaptive, autonomic and context-aware computing
Advance Computing technology and their application
Advanced Computing Architectures and New Programming Models
Advanced control and measurement
Aeronautical Engineering,
Agent-based middleware
Alert applications
Automotive, marine and aero-space control and all other control applications
Autonomic and self-managing middleware
Autonomous vehicle
Biochemistry
Bioinformatics
BioTechnology(Chemistry, Mathematics, Statistics, Geology)
Broadband and intelligent networks
Broadband wireless technologies
CAD/CAM/CAT/CIM
Call admission and flow/congestion control
Capacity planning and dimensioning
Changing Access to Patient Information
Channel capacity modelling and analysis
Civil Engineering,
Cloud Computing and Applications
Collaborative applications
Communication application
Communication architectures for pervasive computing
Communication systems
Computational intelligence
Computer and microprocessor-based control
Computer Architecture and Embedded Systems
Computer Business
Computer Sciences and Applications
Computer Vision
Computer-based information systems in health care
Computing Ethics
Computing Practices & Applications
Congestion and/or Flow Control
Content Distribution
Context-awareness and middleware
Creativity in Internet management and retailing
Cross-layer design and Physical layer based issue
Cryptography
Data Base Management
Data fusion
Data Mining
Data retrieval
Data Storage Management
Decision analysis methods
Decision making
Digital Economy and Digital Divide
Digital signal processing theory
Distributed Sensor Networks
Drives automation
Drug Design,
Drug Development
DSP implementation
E-Business
E-Commerce
E-Government
Electronic transceiver device for Retail Marketing Industries
Electronics Engineering,
Embeded Computer System
Emerging advances in business and its applications
Emerging signal processing areas
Enabling technologies for pervasive systems
Energy-efficient and green pervasive computing
Environmental Engineering,
Estimation and identification techniques
Evaluation techniques for middleware solutions
Event-based, publish/subscribe, and message-oriented middleware
Evolutionary computing and intelligent systems
Expert approaches
Facilities planning and management
Flexible manufacturing systems
Formal methods and tools for designing
Fuzzy algorithms
Fuzzy logics
GPS and location-based app
Various Techniques for Condition Monitoring of Three Phase Induction Motor- ...
Similar to call for papers, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJEI, call for papers 2012,journal of science and technolog
A SECURE KEY TRANSFER PROTOCOL FOR GROUP COMMUNICATIONacijjournal
Providing security for messages in group communication is more essential and critical nowadays. In
group oriented applications such as Video conferencing and entertainment applications, it is necessary to
secure the confidential data in such a way that intruders are not able to modify or transmit the data. Key
transfer protocols fully rely on trusted Key Generation Center (KGC) to compute group key and to
transport the group keys to all communication parties in a secured and secret manner. In this paper, an
efficient key generation and key transfer protocol has been proposed where KGC can broadcast group
key information to all group members in a secure way. Hence, only authorized group members will be
able to retrieve the secret key and unauthorized members cannot retrieve the secret key. Hence, inorder
to maintain the forward and backward secrecy, the group keys are updated whenever a new member joins
or leaves the communication group. The proposed algorithm is more efficient and relies on NP class. In
addition, the keys are distributed to the group users in a safe and secure way. Moreover, the key
generated is also very strong since it uses cryptographic techniques which provide efficient computation.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
MINIMISATION OF KEY GENERATION OVERHEAD IN GROUP KEY MANAGEMENT WITH MODULAR ...IJCI JOURNAL
Multicast communication experiences recipient get to issue due to forward secrecy, backward secrecy. The group key management is a productive component to handle this circumstance. Be that as it may, there are numerous entities which impact the communication, computation overhead, message size, storage overhead and so forth. There are we require proficient group key management path to deal with secure the frame function and decrease the overhead in the current approach by utilizing Key Graph. Exist key graph [7] proposed the augmentation of the double key tree to 4-ary key tree. 4-ary key tree beat the issue of reentering as far as height of the key tree. Using a greater degree reduces the height of the key tree and, as a result, improves re-keying performance with the help of Modular Function.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
An authenticated key management scheme for securing big data environmentIJECEIAES
If data security issues in a big data environment are considered, then the distribution of keys, their management, and the ability to transfer them between server users in a public channel will be one of the most critical issues that must consider on. In which the importance of keys management may outweigh the importance of the encryption algorithm strength. Therefore, this paper raised a new proposed scheme called authenticated key management scheme (AKMS) that works through two levels of security. First, to concerns how the user communicates with the server with preventing any attempt to penetrate senders/receivers. Second, to make the data sent vague by encrypting it, and unreadable by others except for the concerned receiver, thus the server function be limited only as a passageway for communication between the sender and receiver. In the presented work some concepts discussed related to analysis and evaluation as keys security, data security, public channel transmission, and security isolation inquiry which demonstrated the rich value that AKMS scheme carried. As well, AKMS scheme achieved very satisfactory results about computation cost, communication cost, and storage overhead which proved that AKMS scheme is appropriate, secure, and practical to use and protect the user's private data in big data environments.
Security Model for Hierarchical Clustered Wireless Sensor NetworksCSCJournals
The proposed security system for the Wireless Sensor Network (WSN) is based on the WSN security design goal that ‘to design a completely secure WSN, security must be integrated into every node of the system’. This paper discusses on two main components of the security framework viz. the secure key management module and the secure routing scheme. The incorporation of security mechanism during the routing protocol design phase is the main focus of this paper. The proposed security framework viz. ‘Secure and Hierarchical, a Routing Protocol’ (SHARP) is designed for the wireless sensor network applications which is deployed particularly for data collection purpose in a battlefield where the security aspect of the network cannot be compromised at any cost. SHARP consists of three basic integrated modules and each module performs a well defined task to make the whole security framework a complete system on its own.
Secure key exchange thrtough elgamal cryptography in ad hoc networks ijser fo...Sai Vikas Gunti
A theoretical approach for key exchange which is used for computer security in adhoc wireless networks
Similar to call for papers, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJEI, call for papers 2012,journal of science and technolog (20)
call for papers, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJEI, call for papers 2012,journal of science and technolog
1. International Journal of Engineering Inventions
ISSN: 2278-7461, www.ijeijournal.com
Volume 1, Issue 5 (September2012) PP: 33-40
A Novel Approach for Secured Symmetric Key Distribution in
Dynamic Multicast Networks
J.Rajani1, D.Rajani2,
1
Department of CSE, JNTUH, Hyderabad,
2
Department of IT, JNTUH, Hyderabad
Abstract––Multicasting is an efficient means of distributing data in terms of resources usage. All the designated receivers
or members in a multicast group share a session key. Session keys shall change dynamically to ensure both forward
secrecy and backward secrecy of multicast sessions. The communication and storage complexity of multicast key
distribution problem has been studied extensively. We implement a new multicast key distribution scheme whose
computation complexity is significantly reduced. Instead of using conventional encryption algorithms, the scheme
employs MDS codes, a class of error control codes, distribute multicast key dynamically. This scheme considerably
reduces the computation load on each group member as compared to existing schemes employing traditional encryption
algorithms. It easily combined with any key-tree-based schemes and provides much lower computation complexity while
maintaining low and balanced communication complexity and storage complexity for secure dynamic multicast key
distribution.
Keywords-distribution,multicast,MDScodes, computation complexity, erasure decoding, GC.
I. INTRODUCTION
Key Management is one of the security service required for many group oriented and distributed applications. In
such applications data can be communicated using a secure group key which helps in key distribution techniques. Multicast
is an essential mechanism to achieve scalable information, distribution for group-oriented applications. Multicast refers to
communication where information is sent from one or more parties to a set of other parties in terms of resource (such as
network bandwidth, server computation and I/O load) usage. In this case, the information is distributed from one or more
senders to a set of receivers, but not to all users of the group. The advantage of multicast is that, it enables the desired
applications to service many users without overloading a network and resources in the server. Security is provided when data
is transmitting through an insecure network. Unicast security has several schemes to provide the issues which cannot be
extended directly to the multicast environment. As the transmission takes place over multiple network channels, multicasting
is more vulnerable than unicasting. In many applications, the multicast group membership change dynamically i.e. some new
members are authorized to join a new multicast session while some old members should be excluded. In order to ensure both
forward secrecy and backward secrecy, session keys are dynamically changed the forward secrecy is maintained if an old
member who has been excluded from the current session cannot access the communication of the current session. And
backward secrecy is guaranteed if a new member of the current session cannot recover the communication of past sessions.
This requires each session need a new key that is only known to the current session members, i.e., session keys need to be
dynamically distributed to authorize session members. Group key management is the major issue in multicast security,
which is the fundamental technology to secure group communication by generating and updating secret keys [4]. Access
control and data confidentiality can be facilitated using key management by ensuring that the keys used to encrypt group
communication are shared only among the legitimate group members and only those members can access the group
communication [5] .The shared group key can be used for authentication and also for encrypting the message from a
legitimate group member. In order to prevent the above said problems in the secured multicast communication environment,
the following two security criteria are used. Forward Secrecy, is maintained if an old member who has been evicted should
not be able to access the messages from the current and future sessions. Backward secrecy, is guaranteed if a new member
of the current session cannot recover the communication data of past sessions. The process of changing the session key and
communicating the same to only the legitimate group members is called as Re keying. Group key management schemes are
of three types. Centralized key management: group members trust a centralized server, referred to as the key distribution
center (KDC), which generates and distributes encryption keys. Decentralized scheme: the task of KDC is divided among
subgroup managers. Contributory key management schemes: Group members are trusted equally and all participate in key
establishment. In this paper, we study how a multicast group key can efficiently be distributed in computation. In this a
centralized key management model is used where session keys are issued and distributed by a central group controller (GC),
as it has much less communication complexity, when compared to distributed key exchange protocols[4]. The group
controller uses the communication, computation and storage resources for distributing the session key to the group members.
The main problem here is how the resources can be used to distribute the session key, which is referred to as group key
distribution problem. There are two approaches that are generally used for distributing the session key to the group of n
members. The first approach is that the group controller GC shares an individual key with each group member. This key is
used to encrypt a new group session key. The second approach is that the group controller shares an individual key with each
33
2. A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
subset of the group, which can then be used to multicast a session key to a designated and Subset of group members. This
approach has less communication, computation and storage complexity when compared to the other approach.
A multicast group with large number of members uses the key-tree-based approach. In this approach it
decomposes a large group into multiple layers of subgroups with smaller sizes. Using this approach the communication
complexity is much reduced, but the storage and computation complexity is increased. In this paper, the main aim is to
reduce the rekeying cost. A new novel approach for computation efficient rekeying for multicast key distribution is
introduced[4][5][14], which reduces the rekeying cost by employing a hybrid group key management scheme .It also
maintains the same security level without increasing the communication and storage complexity. In this scheme, session
keys are encoded using error control codes. In general encoding and decoding uses error control code to reduce the
computation complexity. Thus, the computational complexity of key distribution can be significantly reduced.
1.1 Proposed System
For a time sensitive applications membership change occurs very frequently. In such environment the group
controller only communicates the new session keys to the only existing members of the group. Efficient key distribution is
an important problem for secure group communications. The communication and storage complexity of multicast key
distribution problem has been studied extensively. The scheme employs MDS (Maximum Distance Separable) codes [3], a
class of error control codes, to distribute multicast key dynamically. This scheme drastically reduces the computation load of
each group member compared to existing schemes employing traditional encryption algorithms. Such a scheme is desirable
for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due
to battery power limitations. This ensures easy combination with any key-tree-based schemes and also provides much lower
computation complexity while maintaining low and balanced communication complexity and storage complexity for secure
dynamic multicast key distribution [10].
Advantages of the Proposed System:
The group controller responsibilities are shared by the Group control intermediate such as Re keying process and
scalability of the group process. Use the Identity tree based structure:
1. The group members are not affected by the key generation process when they are willing to communicate with any other
group members.
2. The Centralized key server used for key generation process and the KGC is also act as a Router for group to group
communication.
3. The Re keying process is done only to the particular group members not to the entire group members.
II. BASIC SCHEME (KDC WITH MDS CODES)
MDS codes
Block codes that achieve equality in Singleton bound are called MDS (maximum distance separable) codes.
Examples of such codes include codes that have only one codeword (minimum distance n), codes that use the whole of
(Fq)n(minimum distance 1). Maximum Distance Separable (MDS) codes are a class of error control codes. that meet the
Singleton bound [13, chapter 11]. Letting GF(q) be a finite field with q elements [13], an (n; k) (block) error control code is
then a mapping from GF(q)k to GF(q)n : E(m) ¼ c, where m ¼ m1m2 _ _ _mk is the original message block, c ¼ c1c2 _ _ _
cn is its code word block, and E(_) is an encoding function, with k _ n. If a decoding function D(_) exists such that D(ci1ci2
_ _ _ cik; i1; i2; _ _ _ ; ik) ¼ m for 1 _ ij _ n and 1 _ j _ k, then this code is called an (n; k) MDS code[3]. For an (n; k) MDS
code, the k original message symbols can be recovered from any k symbols of its code word block. The process of
recovering the k message symbol is called erasure decoding. All the symbols are defined over GF(q), and usually, q ¼ 2m.
The well-known Reed-Solomon (RS) codes [4] are a class of widely usedMDScodes. Notably, the RS codes and other MDS
codes [8] can be used to construct secret-sharing and threshold schemes [5] [7].
2.1 MDS Code Algorithm
MDS consists of three phases:
1) The initialization of the GC
2) The join of a new member
3) The re-keying procedure whenever a group member leaves.
Step 1: The initialization of the GC, Initially GC constructs a codeword C using MDS, C is over a finite space GF(q)
Step 2: One way Hash function H (.)[12], domain of H(.) is GF.
Step 3: Property of H(.) is H(x)=y, it is impossible to derive X from y.
Step 4: The joining of a new member: For a member I,
Then GC sends (ji; si) as a unicast message.
Step 5: Ji= +ve integer ji!=jk.
Step 6: Si= random seed element.
Step 7: The re-keying procedure whenever a group member leaves Select r from space f, r should not be used
already to generate the group key. For every member j GC constructs an element Cj in GF(q).
Step 8: Cj=H(Si+r).
Step 9: Member j every ‗n‘ members in the group calculate these own codeword C1 C2………..Cn.
III. KEY GENERATION AND DISTRIBUTION FRAMEWORK
3.1 Key Generation
34
3. A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
Private Key
The Private Key is generated using MDS code. The GC sends his number of group members to the KGC (Key Generation
Center). The keys are generated by the KGC and submitted to the GC.
Session Key
In session key generation, initially sixteen decimal digits are generated by using random number generation method .Then
each decimal digit is splited and compared with pre determined binary format. In DES algorithm the 64 bits session key is
considered as a message file and generated user‘s private key is considered as a key file. DES algorithm encrypts the session
key by using user‘s private key and transmitted to the appropriate users.
Join operation
User Join request
Find join position Tree structure
Generate keys
to be changed
Member updates Distribute the
the appropriate keys keys changed
Fig 1: join operation
Join Request
A Network node issues a request to GC to join the group. The GC checks whether the request is from an authenticated
member or not. If yes the GC accepts the request. Then the node communicates its session key through some secure channel
as shown in figure 1.
Find join position
The GC group controller maintains a tree structure and the tree structure is the logical arrangement of members. The GC
(Group controller) traverses the tree structure and finds a position for the new member. The GC inserts the member details in
this new position, which is a leaf node.
Generate keys
From the new position onwards the GC generates the new
key(s) along the path to root. The new keys are used to replace the old keys of the auxiliary nodes. Update tree structure Old
keys are replaced by their corresponding new keys. Hence forth newly generated keys are used for future communication.
This operation provides backward secrecy i.e. it prevents the newly joined member from accessing the previously
communicated data.
Distribute keys
A packet is constructed, which consists of newly generated key(s). This packet is encrypted using the old key known by a
member or sub-group of members.
User-oriented re-keying
In the user-oriented re keying, the GC constructs each re keying message. Rekey message contains the encrypted form of
session key. So that they contain exactly all the messages that some user or a group of users need.
Key-oriented re-keying
Key-oriented strategy emphasizes that each new key should be packed into a separate message and distributed to the holders
Leave operation
Leave request Proces
s
Remove the
member
Generate
keys to be
changed
Member updates
the appropriate Distribute the keys
keys changed
35
4. A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
Multicasting
Change key KGC Multicast the Key
Unicasting
Transmit the
Specify the user
Message
Figure 2: leave operation
Leave Request
The member issues a request to leave the group as shown in figure 2 .
Process Request
The GC checks whether the request is from an existing member, if so the GC accepts the request as shown in figure 2.
Find leave position
The GC traverses the tree structure and finds the leaving position of the member. The GC then deletes the member details
and removes the node from tree structure.
Generate keys
From the leaving position onwards the GC generates the new key(s) along the path to root. Old keys are replaced by their
corresponding new keys. Hence forth newly generated keys are used for future communication. This operation provides
forward secrecy, i.e. it prevents the left member from accessing the data sent in future communication.
Distribute keys
A packet is constructed, which consists of newly generated key(s). This packet is encrypted using the old key known by a
member or sub-group of members. These new keys help the members to decrypt the messages sent in future communication.
Member updates keys
After receiving the message, the member updates the appropriate set of keys.
User-oriented re-keying
In the user-oriented re keying, the group controller constructs each re keying message [14]. Rekey message contains the
encrypted form of session key, So that they contain exactly all the messages that some user or a group of users need.
Key-oriented re-keying
Key-oriented strategy emphasizes that each new key should be packed into a separate message and distributed to the holders.
3.2 Message Transmission
Multicasting is a process of sending a message to a selected group. Internet applications, such as online games,
newscast, stock quotes, multiparty conferences, and military communications can benefit from secure multicast
communications [10]. In most of these applications, users typically receive identical information from a single or multiple
senders. Hence, grouping these users into a single multicast group and providing a common session encryption key to all of
them will reduce the number of message units to be encrypted by the senders. Various types of data communication are
broadcast, Multicast, group communication.
Figure 3: Transmission of the message M through 4 point-to-point connections.
36
5. A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
Above figure 3 shows the transmission of message m to four point to point connections. Here node number 1 is the service
provider. Nodes 2,3,4,5 are the receiving nodes. 2,3,4,5 Nodes are receiving the same message.
Group communication
For group communications, the server distributes to each member a group key to be shared by all members [10]. The GC
distributing the group key securely to all members requires messages encrypted with individual keys as shown in [figure 4].
Each such message may be sent separately via unicast. Alternatively, the messages may be sent as a combined message to all
group members via multicast. Either way, there is a communication cost proportional to group size (measured in terms of the
number of messages or the size of the combined message). Observe that for a point-to-point session, the costs of session
establishment and key distribution are incurred just once, at the beginning of the session. On the other hand, group session
may persist for a relatively long time with members joining and leaving the session. Consequently, the group key should be
changed frequently. To achieve a high level of security, the group key should be changed after every join and leave so that a
former group member has no access to current communications and a new member has no access to previous
communications.
Transfer the View the
Encryption Decryption
Message Message
Figure 4: Group Communication
3.3 Cryptography
Cryptography is the process of protecting information by transforming it into an unreadable format called cipher
text. Only those who possess a secret key can decrypt the message into text. Encryption is the process of conversion of
original data (called plain text) into unintelligible form by means of reversible translation i.e. based on translation table or
algorithm, which is also called enciphering. Decryption is the process of translation of encrypted text (called cipher text) into
original data (called plain text), which is also called deciphering. Cryptography plays a major role in the security aspects of
multicasting. For example, consider stock data distribution group, which distributes stock information to a set of users
around the world. It is obvious that only those who have subscribed to the service should get the stock data information. But
the set of users is not static. New customers joining the group should receive information immediately but should not receive
the information that was released prior to their joining. Similarly, if customers leave the group, they should not receive any
further information.
3.4 Authentication
The Login Module is used for the newly joined users to send a request to the Group Controller and it is used for to
retrieve the Private keys after the Group Controller assign keys to the new users as shown in [figure 5]. The user login the
group to enter the user Id and Private Key. If the user Id and private key is correct means the user view the inbox and outbox
message otherwise to display the message box ―Enter the correct Password‖.
Check the Yes
See the Inbox
User Login Uname& Secret
& outbox
code
No
Please enter
the secret code
Figure 5: Authentication
System Flow Diagram
Figure 6: system Flow Diagram
37
6. A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
IV. COMPARISON WITH TRADITIONAL CRYPTOGRAPHIC SCHEMES
To evaluate the proposed scheme, a multicast key distribution scheme is implemented to disseminate 128-bit
session keys among a 3-ary balanced key tree. The pro-posed schemes compared with traditional cryptographic schemes.
As the communication and storage complexity are the same among all the schemes, it suffices to simply compare the
computation complexity. The comparison considers the following scenario, where each three- member group has one
member that departs. These departures are not constrained to happen at the same time, but un practice, they might tend to
be close. For example at the end of one movie broadcast etc.This makes a batch proceed possible, which means that all
remaining members could be rekeyed at once. Before reporting the experimental result, it is worth pointing out that any one-
way hash function [112] used in the proposed scheme can be simplified from general-sense hash function implementations.
For instance, we use the MD5 algorithm [9] as an exemplary hash function in our evaluation. Which produces a 128-bit hash
output from any arbitrary length input? A general MDS input input consists of three components:1)input data 2)padding bits,
and 3)a final 64-bit field for length. In our case, as the input is always 128 bits, we can present the final length field to
represent 128. Moreover, all the rest bits can be set to 0 and removed from MDS logic. This tends to make MDS algorithm
more efficient. Obviously, the same method can be readily applied to other hash algorithms. For example, SHA-1 and SHA
256[9].The MDS algorithm is considered insufficient or using longer session key becomes necessary Experiments are
conducted to compare the computation complexity of the proposed scheme with the conventional cryptographic schemes.
The particular cryptographic algorithms compares in the experiments are CAST-128[14], IDEA [8], AES [1], and RC4 [9],
All keys are set to be 128 bits. To make the comparison as fair as possible, we use the widely adopted and highly optimized
software-based cryptography implementation, i.e., the Cryptography [6] package .We use the same optimization flags to
compile both the cryptography package and our own optimized RS code implementation. We disable the hardware
acceleration (SSE/SSE2) and tend not to compare under that scenario, simply because it is not ubiquitous over all platforms
yet (for example, not available on mobile devices).
Table-1Computational Time Comparing To the RC4
(Multicast Group Size of 59,049)
CAST-
TIME(MS) MDS AES IDEA 128 RC4
GC 23 81 71 99 227
MEMBER 5 23 82 23 61
The computation time of the key distribution is compared to conventional stream ciphers, as shown in Table 1, for
a selected multicast group size. Notice that the computation times of both the GC and the member using the RC4 cipher are
significantly larger than using other schemes. Even though RC4 itself is a fast stream cipher, its key scheduling process has
dominant effect in this particular scenario, where only 128-bit data is encrypted/decrypted using any given key. Results
under other multicast group sizes are similar, which are thus not duplicated here. Finally it is worth nothing that our basic
scheme simply reduces computation complexity by replacing crypto-graphic encryption and decryption operations with more
efficient encoding and decoding operations. It is orthogonal to any other schemes that use different rekeying protocols and
procedures. This basic scheme can always be combined with any re-keying schemes that use cryptographic encryption and
decryption operations. For example, this basic scheme can be readily adapted incorporate so the called one-way function tree
scheme [6], where a different rekeying protocol on a key tree is used other than the traditional scheme, as described in
Section 4, to further reduce the computation complexity. We leave this simple exercise to interested readers.
V. IMPLEMENTAION AND RESULTS
A member can register under a particular group controller by selecting one of the groups as shown in [figure 5.1].
When the member selects the group new session key is created for that group. This session key is used to send a request to
the group controller where in the group controller maintains all the details regarding all the members of that particular group
in a database as shown in the [figure 5.2]. Whenever the request goes to the group controller the session key is going to the
compare with the exercising session key available if the session key matches then the member joins the group and active
rekeying process starts as shown in [figure 5.3].
Figure 5.1 Group Login Window
38
7. A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
Figure 5.2 Send Request Window
Fig 5.3 Group Controller member join Window
Whenever the member leave the group the existing data base is going to be updated automatically updated to the
system a new session key is generated so that a new member can join the group. The enter data base is maintained by the
group controller. The GC is responsible for generating the session key every time whenever the group member joins or
leaves the group as shown in [figure 5.4 and 5.5].
Figure 5.4 Group Controller member Leave Window
Figure 5.5 Keys Generated Window
VI. CONCLSION
We have presented a dynamic multicast key distribution scheme using MDS codes. The computation complexity
of key distribution is greatly reduced by employing only erasure decoding of MDS codes in-stead of more expensive
encryption and decryption computations. Easily combined with key trees or other rekeying protocols that need encryption
and decryption operations, this scheme provides much lower computation complexity while maintaining low and balanced
communication complexity and storage complexity for dynamic group key distribution. This scheme is thus practical for
many applications in various broadcast capable networks such as Internet and wireless networks.
39
8. A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks
REFERENCE
1. AES Algorithm (Rijndael) Information, http://csrc.nist.gov/Cryptotoolkit/aes/rijindael/, 2007.
2. M.Abdalla y.shavitt,and A.wool,‖Towards making broad cast encryption practical,‖IEEE/ACM
trans.networking,vol.8,no.4,pp.443-454,aug.2000
3. M. Blaum, J. Bruck, and A. Vardy, ―MDS Array Codes withIndependent Parity Symbols,‖ IEEE Trans.
Information Theory,vol. 42, no. 2, pp. 529-542, Mar. 1996.
4. R. Blom, ―An Optimal Class of Symmetric Key Generation Systems,‖ Advances in Cryptology—Proc.
Workshop Theory and Application of Cryptographic Techniques (EUROCRYPT ‘84).
5. J. Snoeyink, S. Suri, and G. Varghese, ―A Lower Bound for Multicast Key Distribution,‖ Proc. IEEE INFOCOM
‘01, Apr. 2001.
6. W.Dai,Crypto++Library,http://www.eskimo.com/~weidai/ cryptlib.html, 2007.
7. J.Blomer,M.Kalfare,M.Karpinaki,R.Karp,M.Luby,and D.Zuckeman,‖An XOR –Based Erasure-Resilient
coding scheme‖, technical report tr-95-048,int‘1 computer science inst,aug.
8. vol. 45, no. 1, pp. 272- 276, Jan. 1999.
9. B. Schneier, Applied Cryptography, second ed. John Wiley & Sons,1996
10. Jack Snoeyink, Subhash Suri, George Varghese ―A Lower Bound for Multicast Key Distribution‖ IEEE
PAPER,2001.
11. Xiaozhou Steve Li, Yang Richard Yang, Mohamed G. Gouda, Simon S. Lam ―Batch Rekeying for Secure Group
Communications ― IEEE PAPER,2009.
12. A.T. Sherman and D.A. McGrew, ―Key Establishment in Large dynamic group on way hash function
trees‖,IEEE trans,software engg,vol 20,po 5,pp444-458,may 2003.
13. F.J.macwilliams and N.J.A Sloane,The thory of error correcting codes,north -holland math.library,1977.
14. Sanjeev Setia_ Samir Koussih_,Sushil Jajodia ―A Scalable Group Re-Keying Approach for Secure Multicast‖
IEEE PAPER,2000.
Authors
Rajani received M.Tech in Computer science from JNTUH University, Hyderabad, A.P., India. Currently
working in Institute of Aeronautical Engineering as an Associate professor in CSE department (IARE) R.R.Dist, A.P, and
India. She has 6 years of experience. Her research interests include Computer Networks, Operating Systems, Information
Security, JAVA, and J2EE.
D. Rajani received Bachelor‘s degree in Computer science and Engineering from JNTUH, Pursuing M.Tech in
Information and Technology from Institute of Aeronautical Engineering. She is a research scholar in field of Information
Security.
40