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 Cooperative Peer Clustering Scheme for Unstructured Peer-to-Peer Systemsijp2p
This paper proposes a peer clustering scheme for unstructured Peer-to-Peer (P2P) systems. The proposed
scheme consists of an identification of critical links, local reconfiguration of incident links, and a
retaliation rule. The simulation result indicates that the proposed scheme improves the performance of
previous schemes and that a peer taking a cooperative action will receive a higher profit than selfish peers.
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
A Good Performance OTP Encryption Image based on DCT-DWT SteganographyTELKOMNIKA JOURNAL
The security aspect is very important in data transmission. One way to secure data is with
steganography and cryptography. Surely research on this should continue to be developed to improve
security. In this paper, we proposed a combination of steganographic and cryptographic algorithms for
double protection during data transmission. The selected steganographic algorithm is the use of a
combination of DCT and DWT domain transformations. Because the Imperceptibility aspect is a very
important aspect of steganographic techniques, this aspect needs to be greatly improved. In the proposed
method of DCT transformation first, proceed with DWT transformation. From the experimental results
obtained better imperceptibility quality, compared with existing methods. To add OTP message security
applied algorithm to encrypt the message image, before it is inserted. This is evidenced by experiments
conducted on 20 grayscale images measuring 512x512 with performance tests using MSE, PSNR, and
NC. Experimental results prove that DCT-DWT-OTP generates PNSR more than 50 dB, and NC of all
images is 1.
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 Real Time Framework of Multiobjective Genetic Algorithm for Routing in Mobi...IDES Editor
Routing in mobile networks is a multiobjective
optimization problem. The problem needs to consider multiple
objectives simultaneously such as Quality of Service
parameters, delay and cost. This paper uses the NSGA-II
multiobjectve genetic algorithm to solve the dynamic shortest
path routing problem in mobile networks and proposes a
framework for real-time software implementation.
Simulations confirm a good quality of solution (route
optimality) and a high rate of convergence.
AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONSIJNSA Journal
Group communication implies a many-to-many communication and it goes beyond both one-to-one
communication (i.e., unicast) and one-to-many communication (i.e., multicast). Unlike most user
authentication protocols that authenticate a single user each time, we propose a new type of authentication,
called group authentication, that authenticates all users in a group at once. The group authentication
protocol is specially designed to support group communications. There is a group manager who is
responsible to manage the group communication. During registration, each user of a group obtains an
unique token from the group manager. Users present their tokens to determine whether they all belong to
the same group or not. The group authentication protocol allows users to reuse their tokens without
compromising the security of tokens. In addition, the group authentication can protect the identity of each
user.
A Cooperative Peer Clustering Scheme for Unstructured Peer-to-Peer Systemsijp2p
This paper proposes a peer clustering scheme for unstructured Peer-to-Peer (P2P) systems. The proposed
scheme consists of an identification of critical links, local reconfiguration of incident links, and a
retaliation rule. The simulation result indicates that the proposed scheme improves the performance of
previous schemes and that a peer taking a cooperative action will receive a higher profit than selfish peers.
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
A Good Performance OTP Encryption Image based on DCT-DWT SteganographyTELKOMNIKA JOURNAL
The security aspect is very important in data transmission. One way to secure data is with
steganography and cryptography. Surely research on this should continue to be developed to improve
security. In this paper, we proposed a combination of steganographic and cryptographic algorithms for
double protection during data transmission. The selected steganographic algorithm is the use of a
combination of DCT and DWT domain transformations. Because the Imperceptibility aspect is a very
important aspect of steganographic techniques, this aspect needs to be greatly improved. In the proposed
method of DCT transformation first, proceed with DWT transformation. From the experimental results
obtained better imperceptibility quality, compared with existing methods. To add OTP message security
applied algorithm to encrypt the message image, before it is inserted. This is evidenced by experiments
conducted on 20 grayscale images measuring 512x512 with performance tests using MSE, PSNR, and
NC. Experimental results prove that DCT-DWT-OTP generates PNSR more than 50 dB, and NC of all
images is 1.
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 Real Time Framework of Multiobjective Genetic Algorithm for Routing in Mobi...IDES Editor
Routing in mobile networks is a multiobjective
optimization problem. The problem needs to consider multiple
objectives simultaneously such as Quality of Service
parameters, delay and cost. This paper uses the NSGA-II
multiobjectve genetic algorithm to solve the dynamic shortest
path routing problem in mobile networks and proposes a
framework for real-time software implementation.
Simulations confirm a good quality of solution (route
optimality) and a high rate of convergence.
AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONSIJNSA Journal
Group communication implies a many-to-many communication and it goes beyond both one-to-one
communication (i.e., unicast) and one-to-many communication (i.e., multicast). Unlike most user
authentication protocols that authenticate a single user each time, we propose a new type of authentication,
called group authentication, that authenticates all users in a group at once. The group authentication
protocol is specially designed to support group communications. There is a group manager who is
responsible to manage the group communication. During registration, each user of a group obtains an
unique token from the group manager. Users present their tokens to determine whether they all belong to
the same group or not. The group authentication protocol allows users to reuse their tokens without
compromising the security of tokens. In addition, the group authentication can protect the identity of each
user.
A NEW KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORKSIJNSA Journal
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authenticated pairwise key establishment and integrating LU Matrix with Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the meantime, it is able to achieve efficient group key agreement and management. Analysis shows that the new scheme has better performance and provides authenticity and anonymity for sensor to establish multiple kinds of keys, compared with previous related works.
Selfish Node Isolation & Incentivation using Progressive ThresholdsIDES Editor
The problems associated with selfish nodes in
MANET are addressed by a collaborative watchdog approach
which reduces the detection time for selfish nodes thereby
improves the performance and accuracy of watchdogs[1]. In
the related works they make use of credit based systems, reputation
based mechanisms, pathrater and watchdog mechanism
to detect such selfish nodes. In this paper we follow an approach
of collaborative watchdog which reduces the detection
time for selfish nodes and also involves the removal of such
selfish nodes based on some progressively assessed thresholds.
The threshold gives the nodes a chance to stop misbehaving
before it is permanently deleted from the network.
The node passes through several isolation processes before it
is permanently removed. Another version of AODV protocol
is used here which allows the simulation of selfish nodes in
NS2 by adding or modifying log files in the protocol.
A Modified Pair Wise Key Distribution Schemes and There Effect On Network Per...IJERA Editor
Key distribution schemes has always played a pivotal role in the security of wireless sensor networks. In this research work we focus mainly on the security aspect of WSN . We have developed a modified key distribution scheme which uses the concepts of post as well as pre distribution scheme and thus he proved to be a better alternative then the rest of two schemes. Simulation study has been carried out using matlab. The effort turned out to be fruitful s our modified scheme showed less dead nodes per round of data transfer as compared to post deployment scheme.
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
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
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 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 NEW KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORKSIJNSA Journal
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authenticated pairwise key establishment and integrating LU Matrix with Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the meantime, it is able to achieve efficient group key agreement and management. Analysis shows that the new scheme has better performance and provides authenticity and anonymity for sensor to establish multiple kinds of keys, compared with previous related works.
Selfish Node Isolation & Incentivation using Progressive ThresholdsIDES Editor
The problems associated with selfish nodes in
MANET are addressed by a collaborative watchdog approach
which reduces the detection time for selfish nodes thereby
improves the performance and accuracy of watchdogs[1]. In
the related works they make use of credit based systems, reputation
based mechanisms, pathrater and watchdog mechanism
to detect such selfish nodes. In this paper we follow an approach
of collaborative watchdog which reduces the detection
time for selfish nodes and also involves the removal of such
selfish nodes based on some progressively assessed thresholds.
The threshold gives the nodes a chance to stop misbehaving
before it is permanently deleted from the network.
The node passes through several isolation processes before it
is permanently removed. Another version of AODV protocol
is used here which allows the simulation of selfish nodes in
NS2 by adding or modifying log files in the protocol.
A Modified Pair Wise Key Distribution Schemes and There Effect On Network Per...IJERA Editor
Key distribution schemes has always played a pivotal role in the security of wireless sensor networks. In this research work we focus mainly on the security aspect of WSN . We have developed a modified key distribution scheme which uses the concepts of post as well as pre distribution scheme and thus he proved to be a better alternative then the rest of two schemes. Simulation study has been carried out using matlab. The effort turned out to be fruitful s our modified scheme showed less dead nodes per round of data transfer as compared to post deployment scheme.
Link Prediction in (Partially) Aligned Heterogeneous Social Networks
Similar to A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROTOCOL FOR PEER -TO - PEER INFORMATION SHARING IN MOBILE AD HOC NETWORKS
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
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
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 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 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.
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.
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.
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.
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.
Advanced Data Protection and Key Organization Framework for Mobile Ad-Hoc Net...AM Publications,India
Key organization and protect routing are two major subjects for Mobile Ad-hoc Networks nonetheless preceding explanations tend to contemplate them distinctly. This indicates to Key organization and protects routing inters dependency cycle problem. In this paper, we recommend a Key organization and protection of routing integrated scheme that speeches Key organization and protection of routing inter dependency cycle problem. By using identity based cryptography this scheme delivers produced including confidentiality, honesty, verification, cleanness, and non-repudiation. Connected to symmetric cryptography and conventional asymmetric cryptography as well as preceding IBC arrangements, this arrangement has developments in many features. We deliver hypothetical resistant of the refuge of the scheme and validate the efficiency of the scheme with applied simulation.
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.
Similar to A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROTOCOL FOR PEER -TO - PEER INFORMATION SHARING IN MOBILE AD HOC NETWORKS (20)
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTSijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally.
International Journal of Peer to Peer Networks .docxijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of P2P networks.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results
in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best
practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems,
large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety
of fields can exchange ideas to further research and improve practices in all areas of P2P.
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022)ijp2p
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022) will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the areas of Big Data, Internet of Things (IoT) and Machine Learning. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of Big Data, IoT and Machine Learning.
7th International Conference on Networks, Communications, Wireless and Mobile...ijp2p
7th International Conference on Networks, Communications, Wireless and Mobile Computing (NCWMC 2022) looks for significant contributions to the Computer Networks, Communications, wireless and mobile computing for wired and wireless networks in theoretical and practical aspects. Original papers are invited on computer Networks, network protocols and wireless networks, Data communication Technologies, network security and mobile computing. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
4th International Conference on Internet of Things (CIoT 2022)ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
11th International conference on Parallel, Distributed Computing and Applicat...ijp2p
11th International conference on Parallel, Distributed Computing and Applications (IPDCA 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Parallel, Distributed Computing. Original papers are invited on Algorithms and Applications, computer Networks, Cyber trust and security, Wireless networks and mobile Computing and Bioinformatics. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022)ijp2p
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Cloud computing. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
4th International Conference on Internet of Things (CIoT 2022) ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
3rd International Conference on Networks, Blockchain and Internet of Things (...ijp2p
3rd International Conference on Networks, Blockchain and Internet of Things (NBIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Networks, Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Networks, Blockchain and Internet of Things in theoretical and practical aspects.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas but are not limited to:
3rd International Conference on NLP & Information Retrieval (NLPI 2022)ijp2p
3rd International Conference on NLP & Information Retrieval (NLPI 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Natural Language Computing and Information Retrieval.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to.
CALL FOR PAPERS - 14th International Conference on Wireless & Mobile Networks...ijp2p
14th International Conference on Wireless & Mobile Networks (WiMoNe 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Wireless & Mobile computing Environment. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Wireless, Mobile Networks & its applications had received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PUBLISH YOUR PAPER - INTERNATIONAL JOURNAL OF PEER-TO-PEER NETWORKS (IJP2P)ijp2p
Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of P2P networks.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
3rd International Conference on Blockchain and Internet of Things (BIoT 2022)ijp2p
3rd International Conference on Blockchain and Internet of Things (BIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and
applications of Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Blockchain and Internet of Things in theoretical and
practical aspects. Authors are solicited to contribute to the conference by submitting articles that illustrate research
results, projects, surveying works and industrial experiences that describe significant advances in the areas of Blockchain and Internet of Things.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
CALL FOR PAPERS - 4th International Conference on Internet of Things (CIoT 2022)ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of Internet of Things.
1.Wireless Communication System_Wireless communication is a broad term that i...JeyaPerumal1
Wireless communication involves the transmission of information over a distance without the help of wires, cables or any other forms of electrical conductors.
Wireless communication is a broad term that incorporates all procedures and forms of connecting and communicating between two or more devices using a wireless signal through wireless communication technologies and devices.
Features of Wireless Communication
The evolution of wireless technology has brought many advancements with its effective features.
The transmitted distance can be anywhere between a few meters (for example, a television's remote control) and thousands of kilometers (for example, radio communication).
Wireless communication can be used for cellular telephony, wireless access to the internet, wireless home networking, and so on.
APNIC Foundation, presented by Ellisha Heppner at the PNG DNS Forum 2024APNIC
Ellisha Heppner, Grant Management Lead, presented an update on APNIC Foundation to the PNG DNS Forum held from 6 to 10 May, 2024 in Port Moresby, Papua New Guinea.
# Internet Security: Safeguarding Your Digital World
In the contemporary digital age, the internet is a cornerstone of our daily lives. It connects us to vast amounts of information, provides platforms for communication, enables commerce, and offers endless entertainment. However, with these conveniences come significant security challenges. Internet security is essential to protect our digital identities, sensitive data, and overall online experience. This comprehensive guide explores the multifaceted world of internet security, providing insights into its importance, common threats, and effective strategies to safeguard your digital world.
## Understanding Internet Security
Internet security encompasses the measures and protocols used to protect information, devices, and networks from unauthorized access, attacks, and damage. It involves a wide range of practices designed to safeguard data confidentiality, integrity, and availability. Effective internet security is crucial for individuals, businesses, and governments alike, as cyber threats continue to evolve in complexity and scale.
### Key Components of Internet Security
1. **Confidentiality**: Ensuring that information is accessible only to those authorized to access it.
2. **Integrity**: Protecting information from being altered or tampered with by unauthorized parties.
3. **Availability**: Ensuring that authorized users have reliable access to information and resources when needed.
## Common Internet Security Threats
Cyber threats are numerous and constantly evolving. Understanding these threats is the first step in protecting against them. Some of the most common internet security threats include:
### Malware
Malware, or malicious software, is designed to harm, exploit, or otherwise compromise a device, network, or service. Common types of malware include:
- **Viruses**: Programs that attach themselves to legitimate software and replicate, spreading to other programs and files.
- **Worms**: Standalone malware that replicates itself to spread to other computers.
- **Trojan Horses**: Malicious software disguised as legitimate software.
- **Ransomware**: Malware that encrypts a user's files and demands a ransom for the decryption key.
- **Spyware**: Software that secretly monitors and collects user information.
### Phishing
Phishing is a social engineering attack that aims to steal sensitive information such as usernames, passwords, and credit card details. Attackers often masquerade as trusted entities in email or other communication channels, tricking victims into providing their information.
### Man-in-the-Middle (MitM) Attacks
MitM attacks occur when an attacker intercepts and potentially alters communication between two parties without their knowledge. This can lead to the unauthorized acquisition of sensitive information.
### Denial-of-Service (DoS) and Distributed Denial-of-Service (DDoS) Attacks
Multi-cluster Kubernetes Networking- Patterns, Projects and GuidelinesSanjeev Rampal
Talk presented at Kubernetes Community Day, New York, May 2024.
Technical summary of Multi-Cluster Kubernetes Networking architectures with focus on 4 key topics.
1) Key patterns for Multi-cluster architectures
2) Architectural comparison of several OSS/ CNCF projects to address these patterns
3) Evolution trends for the APIs of these projects
4) Some design recommendations & guidelines for adopting/ deploying these solutions.
Bridging the Digital Gap Brad Spiegel Macon, GA Initiative.pptxBrad Spiegel Macon GA
Brad Spiegel Macon GA’s journey exemplifies the profound impact that one individual can have on their community. Through his unwavering dedication to digital inclusion, he’s not only bridging the gap in Macon but also setting an example for others to follow.
This 7-second Brain Wave Ritual Attracts Money To You.!nirahealhty
Discover the power of a simple 7-second brain wave ritual that can attract wealth and abundance into your life. By tapping into specific brain frequencies, this technique helps you manifest financial success effortlessly. Ready to transform your financial future? Try this powerful ritual and start attracting money today!
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROTOCOL FOR PEER -TO - PEER INFORMATION SHARING IN MOBILE AD HOC NETWORKS
1. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
DOI : 10.5121/ijp2p.2010.1102 10
A NOVEL APPROACH TOWARDS COST EFFECTIVE
REGION-BASED GROUP KEY AGREEMENT
PROTOCOL FOR PEER -TO - PEER INFORMATION
SHARING IN MOBILE AD HOC NETWORKS
K. Kumar1
, J.Nafeesa Begum2
and Dr.V. Sumathy3
1. Research Scholar & Asst .Professor in CSE, Government College of Engg, Bargur-
635104, Tamil Nadu,India
pkk_kumar@yahoo.com
2. Research Scholar & Asst .Professor (Sr) in CSE, Government College of Engg,
Bargur- 635104, Tamil Nadu, India
nafeesa_jeddy@yahoo.com
3. Associate Professor in ECE,Government College of Technology,Coimbatore,
Tamil Nadu,India
sumi_gct2001@yahoo.co.in
ABSTRACT
Peer-to-peer systems have gained a lot of attention as information sharing systems for the wide-
spread 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.
KEYWORDS
Region –Based Key Agreement, Ad-Hoc networks, Peer –to-Peer Information Sharing, Elliptic Curve
Cryptography
1. INTRODUCTION
A peer –to – peer (P2P) system is a self organizing system of equal, autonomous entities
which aims for the shared usage of distributed resources in networked environment avoiding
central services. The P2P networks are a powerful architecture for sharing of resources and
voluminous information among thousands of users. An important issue in P2P system is
searching for resources (e.g., data, files and services) available at one or more of the numerous
host nodes. The distributed nature of P2P systems can be an advantage over client-server
architectures due to the following reasons. First, they tend to be more fault-tolerant as there is
no single point – of – failure. Another important reason is processing of information, network
traffic and data storage can be balanced over all peers, which enables the network to scale well
with the number of peers.
Group Key Agreement (GKA) protocols [1,3], which enable the participants to agree on a
common secret value, based on each participant’s public contribution, seem to provide a good
solution. They don’t require the presence of a central authority. Also, when the group
composition changes, Group Controller can employ supplementary key agreement protocols to
get a new group key.
Elliptic Curve Cryptography (ECC)[2,7] is a public key cryptosystem based on elliptic
curves. The attraction of ECC is that it appears to offer equal security for a far smaller key size,
thereby reducing processing overhead.
2. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
11
In this paper, we propose a reliable and secure Region-Based Key Agreement Protocol for peer-
to-peer information sharing. Here, we break a group into region-based subgroups with leaders in
subgroups communicating with each other to agree on a group key in response to membership
change. In addition to showing that the forward and backward secrecy requirements are satisfied,
we identify optimal settings of our protocol to minimize the overall communication and
computation costs due to group key management.
The contribution of this work includes:
1. In this paper, we propose a new efficient method for solving the group key management
problem for effective P2P information sharing over mobile ad-hoc network. This protocol
provides efficient, scalable, reliable and secure P2P information sharing over ad-hoc
network.
2. We introduce the idea of subgroup and subgroup key and we uniquely link all the
subgroups into a tree structure to form an outer group and outer group key. This design
eliminates the centralized key server. Instead, all hosts work in a peer-to-peer fashion to
agree on a group key. Here we propose a new protocol ECRBGKA (Elliptic Curve
Region-Based Key Agreement) for ad hoc networks. It is a combination of GECDH &
TGECDH protocol so as to keep the group key secure among the group members in P2P
group communication with a shorter key length and same security level as that of other
cryptosystems.
3. We design and implement ECRBGKA protocol in peer-to-peer information sharing using
Java and the extensive experiments show that the secure P2P information sharing in ad-
hoc networks is achievable in addition to the performance issues like memory cost,
communication cost and computation cost.
The rest of the paper is as follows, Section 2 presents the Proposed Schemes. Section 3
describes the message encryption and decryption using ECC. Section 4 describes the
Experimental Results and Discussion. Section 5 describes the performance analysis. and finally
Section 6 concludes the paper.
2. PROPOSED SCHEME
2.1. System Model
In this section we first provide an overview of our secure information sharing system,
including the security model.
2.1.1. Overview of Region-Based Group Key Agreement Protocol:
The goal of this paper is to propose a communication and computation efficient group key
establishment protocol in ad-hoc network. The idea is to divide the multicast group into several
subgroups, let each subgroup has its subgroup key shared by all members of the subgroup. Each
Subgroup has subgroup controller node and a Gateway node, in which Subgroup controller node
is the controller of subgroup and each Gateway node contributes a partial key to agree with a
common outer group key among the subgroups. The last gateway member joining the outer
group acts as outer group controller.
For example, in Figure.1, all member nodes are divided into number of subgroups and
all subgroups are linked in a tree structure as shown in Figure.2.
Figure.1: Members of group are divided into subgroups
3. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
12
Figure.2: Subgroups link in a Tree Structure
The layout of the network is as shown in below Figure.3.
Figure.3. Region based Group Key Agreement
One of the members in the subgroup is subgroup controller. The last member joining the sub
group acts as a subgroup controller. Each outer group is headed by the outer group controller. In
each group, the member with high processing power, memory, and Battery power acts as a
gateway member. Outer Group messages are broadcast through the outer group and secured by
the outer group key while subgroup messages are broadcast within the subgroup and secured by
subgroup key.
Let N be the total number of group members, and M be the number of the subgroups in each
subgroup, then there will be N/M subgroups, assuming that each subgroup has the same number
of members.
Assume that there are a total of N members in Secure Group Communication. After sub
grouping process (Algorithm 1), there are S subgroups M1, M2… Ms with n1, n2 …ns members.
4. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
13
Algorithm. 1. Region-Based Key Agreement protocol
1. The Subgroup Formation
The number of members in each subgroup is
N / S < 100.
Where, N – is the group size. and S – is the number of subgroups.
2.The Contributory Key Agreement protocol is implemented among the group members. It
consists of three stages.
a.To find the Subgroup Controller for each subgroups.
b.GECDH protocol is used to generate one common key for each subgroup headed by the
subgroup controller(i.e Sub group Key (KR)),which performs encryption and decryption
of sub group level messages broadcast to all subgroup members..
c.Each subgroup gateway member contributes partial keys to generate a one common
backbone key (i.e Outer group Key (KG)) ,which is used to encrypt and decrypt the
messages broadcast among subgroup controllers, headed by the Outer Group Controller
using TGECDH protocol.
3. Each Group Controller (Sub /Outer) distributes the computed public key to all its
members. Each member performs rekeying to get the respected group key.
A Regional key KR is used for communication between a subgroup controller and the
members in the same region. The Regional key KR is rekeyed whenever there is a membership
change event occurs due to member join / leave or member failure. The Outer Group key KG is
rekeyed whenever there is a join / leave of Outer group controllers or Gateway member failure
to preserve secrecy.
The members within a subgroup use Group Elliptic Curve Diffie-Hellman Contributory Key
Agreement (GECDH). Each member within a subgroup contributes his share in arriving at the
subgroup key. Whenever membership changes occur, the subgroup controller or previous
member initiates the rekeying operation.
The gateway member initiates communication with the neighboring member belonging to
another subgroup and mutually agree on a key using Tree-Based Group Elliptic Curve Diffie-
Hellman contributory Key Agreement (TGECDH) protocol for inter subgroup communication
between the two subgroups. Any member belonging to one subgroup can communicate with any
other member in another subgroup through this member as the intermediary. In this way adjacent
subgroups agree on outer group key. Whenever membership changes occur, the outer group
controller or previous outer group controller initiates the rekeying operation.
Here, we prefer the subgroup key to be different from the key for backbone. This difference
adds more freedom of managing the dynamic group membership. In addition, using this
approach can potentially save the communication and computational cost.
An information sharing application should allow end users to:
Search for information.
Make their information available.
Download information.
In order to secure this type of information sharing application we need to provide
confidentiality and integrity of all communication and to enforce access control of resources i.e.
communication channels and shared information.
Figure 3. shows the interactions between peers. A peer, P1, searches for information by
sending a query message to the subgroup. The subgroup controller sends the query message to
outer group. Peers subgroup that do not have content that matches the query, do not respond.
Peer P2 has content that matches the query, so it sends a query response message. P1, can then
request to download content from P2 by sending a transfer request message. P2 answers this
request with the content
2.2 .Network Dynamics
The network is dynamic in nature. Many members may join or leave the group. In such case,
a group key management system should ensure that backward and forward secrecy is preserved.
5. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
14
2.2.1. Member Join
When a new member joins, it initiates communication with the subgroup controller. After
initialization, the subgroup controller changes its contribution and sends public key to this new
member. The new member receives the public key and acts as a group controller by initiating the
rekeying operations for generating a new key for the subgroup. The rekeying operation is as
follows.
Join request
New node ubgroup ControllerS→
change its contribution and send public key to
ubgroup Controller New NodeS →
A c t s a s
N e w N o d e N e w S u b g r o u p C o n t r o l le r→
puts its contribution to all the public key value &
Multicast this public key value to
New Subgroup Controller the entire member in the subgroup→
put is contribution to the public value & Compute
Each Member New Subgroup Key→
2.2.2. Member Leave:
1. When a Subgroup member Leaves
When a member leaves the Subgroup Key of the subgroup to which it belongs must be
changed to preserve the forward secrecy. The leaving member informs the subgroup controller.
The subgroup controller changes its private key value, computes the public value and broadcasts
the public value to all the remaining members. Each member performs rekeying by putting its
contribution to public value and computes the new Subgroup Key. The rekeying operation is as
follows.
Leaving Message
Leaving Node Subgroup Controller→
changes its private key value, compute the public key value and
Multicast the public key value to
Subgroup Controller All the remaining Member→
Performs Rekeying and Compute
Each Member New Subgroup Key→
2. When a Subgroup Controller Leaves:
When the Subgroup Controller leaves, the Subgroup key used for communication among the
subgroup controller needs to be changed. This Subgroup Controller informs the previous
Subgroup Controller about its desire to leave the subgroup which initiates the rekeying
procedure. The previous subgroup controller now acts as a Subgroup controller. This Subgroup
controller changes its private contribution value and computes all the public key values and
broadcasts to all the remaining members of the group. All subgroup members perform the
rekeying operation and compute the new subgroup key. The rekeying operation is as follows.
Leaving Message
Leaving Subgroup Controller Old Subgroup Controller→
change its private value,compute the all
public key value and Multicast
Old Subgroup Controller Remaining Member in the group→
Perform Rekeying and Compute
Subgroup Member New Subgroup Key→
3. When an Outer Group Controller Leaves:
When an Outer group Controller leaves, the Outer group key used for communication among
the Outer group need to be changed. This Outer group Controller informs the previous Outer
group Controller about its desire to leave the Outer group which initiates the rekeying procedure.
The previous Outer Group controller now becomes the New Outer group controller. This Outer
group controller changes its private contribution value and computes the public key value and
broadcasts it to the entire remaining member in the group. All Outer group members perform the
rekeying operation and compute the new Outer group key. The rekeying operation is as follows.
Leaving Message
Leaving Outer group Controller Old Outer group Controller→
change its private value,compute the all
public key value and Multicast
Old Outer group Controller Remaing Member in the Outer group→
Perform Rekeying and Compute
Outer group Member New Outer group Key→
4. When a Gateway member leaves
When a gateway member leaves the subgroup, it delegates the role of the gateway to the
adjacent member having high processing power, memory, and Battery power and acts as a new
6. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
15
gateway member. Whenever the gateway member leaves, all the two keys should be changed.
These are
i. Outer group key among the subgroup.
ii. Subgroup key within the subgroup.
In this case, the subgroup controller and outer group controller perform the rekeying operation.
The Controller leaves the member and a new gateway member is selected in the subgroup,
performs rekeying in the subgroup. After that, it joins in the outer group. The procedure is same
as joining the member in the outer group.
2.3. Communication Protocol:
The members within the subgroup have communication using subgroup key (KR). The
communication among the subgroup members takes place through the gateway member using
the Outer Group Key (KG).
2.3.1. Communication within the Subgroup:
1. Sender query search within the Subgroup
The sender member encrypts the message with the subgroup key (KR) and multicasts it to all
member in the subgroup. The subgroup members receive the encrypted message, perform the
decryption using the subgroup key (KR) and gets the original message. The communication
operation is as follows.
KRE [Message] & Multicast
Source Member Destination Member→
[ ]KR KRD E [M essage]
Destination M em ber Q uery M essage→
2. Response for Sender Query
The Destination member encrypts the response message with the Subgroup Key (KR)
and multicast it to all member in the subgroup. The source member receives the encrypted
message, performs the decryption using the subgroup key and gets the response message. The
communication operation is as follows.
K RE [M essage] & M ulticast
D estination M em ber S ource M em ber→
[ ]K R K RD E [M essa g e]
S o u rce M e m b e r R esp o n se M e ssag e→
2.3.2. Communication among the Subgroup:
1. Sender query search among the Subgroup
The sender member encrypts the message with the subgroup key (KR) and multicasts it to all
members in the subgroup. One of the members in the subgroup acts as a gate way member. This
gateway member decrypts the message with subgroup key and encrypts with the outer group key
(KG) and multicast to the entire gateway members in the group. The destination gateway
member first decrypts the message with outer group key. Then encrypts with subgroup key and
multicasts it to all members in the subgroup. Each member in the subgroup receives the
encrypted message and performs decryption using subgroup key and gets the original message.
In this way the region-based group key agreement protocol performs the communication. The
communication operation is as follows.
KRE [Message] & Multicast
Source Member Gateway Member→
[ ]K R KRD E [M essage]
Gateway M em ber Query M essage→
KGE [Message] & Multicast
Gateway Member Gateway Member [ Among Subgroup]→
[ ]K G K GD E [ M e s s a g e ]
G a t e w a y M e m b e r Q u e r y M e s s a g e→
KRE [Message] & Multicast
Gateway Member Destination Member→
[ ]KR KRD E [Message]
Destination Member Query Message→
2. Response for Sender Query
The receiver member encrypts the response message with its subgroup key (KR) and
multicasts it to all members in the subgroup. The gateway member decrypts the response
message with the subgroup key and encrypts with the Outer group key (KG) and multicast to the
entire gateway members in the group. The destination gateway member first decrypts the
7. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
16
message with the Outer group key. Then encrypts with subgroup key and multicast it to all
members in the subgroup. Sender member in the subgroup receives the encrypted message and
performs decryption using subgroup key and gets the response message. The communication
operation is as follows.
KRE [Message] & Multicast
Destination Member Gateway Member→
[ ]K R K RD E [M essag e]
G atew ay M em ber R esponse M essag e→
KGE [Message] & Multicast
Gateway Member Gateway Member [ Among Subgroup]→
[ ]K G K GD E [ M e s s a g e ]
G a t e w a y M e m b e r R e s p o n s e M e s s a g e→
K RE [M e ss a g e ] & M u ltic a s t
G a te w a y M e m b e r S o u rc e M e m b e r→
[ ]K R K RD E [ M e s s a g e ]
S o u r c e M e m b e r R e s p o n s e M e s s a g e→
2.4. Applying Elliptic Curve based Diffie-Hellman Key Exchange
2.4.1. Member Join
User A and user B are going to exchange their keys (figure.4): Take p=211, Ep(0,-4) , which
is equivalent to the curve y2
=x3
– 4 and G = (2,2). A’s private key is nA = 47568, so A’s public
key PA =47568(2,2)=(206,121), B’s private key is nB = 13525,so B’s public key PB
=13525(2,2)=(29,139). The group key is computed (Fig.[ ].) as User A sends its public key
(206,121) to user B, then user B computes their Subgroup key as nB (A’s Public key ) =
13525(206,121) = (155,115). User B sends its public key (29,139) to User A, then User A
compute their Subgroup key as nA(B’s Public key)= 47568(29,139) = (120,180) .The
implementation is shown in figure 7.
Figure.4.User-A & User –B Join the Group.
Figure .5. User- C Join in the Group. Figure.6. User-D Join in the Group.
When User C is going to join in the group, C’s private key becomes nC= 82910. Now, User
C becomes a Subgroup Controller. Then, the key updating process will begin as follows: The
previous Subgroup Controller User B sends the intermediate key as (B’s Public key $ A’s Public
Key $ Group key of A&B)= ((29,139) $ (206,121) $ (155,115)) User C separates the
intermediate key as B’s Public key, A’s Public Key and Group key of A&B=(29,139) ,
(206,121) and (155,115).Then, User C generates the new Subgroup key as nC (Subgroup key of
A&B)= 82910(155,115) = (120,31). Then, User C broadcasts the intermediate key to User A and
User B. That intermediate key is ((Public key of B & C) $ (Public key of A & C)) = ((131,84)
$(147, 97)). Now, User B extracts the value of public key of A & C from the value sent by User
8. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
17
C. Then User B compute the new Subgroup key as follows: nB (Public key of A&C)=
13525(147,97)= (120,31). Similarly, User A extracts the value of public key of B & C from
intermediate key, sent by User C. Then User A compute the new Subgroup key as follows: nA
(public key of B&C) = 47568(131,84) = (120,31). Therefore, New Subgroup Key of A, B and C
= (120, 31) as shown in the figure.5.The same procedure is followed when User D joins as
shown in the Fig.6.The implementation is shown in figure 8 and 9.
Figure 7. User 1 and User2 join the
Subgroup Using GECDH
Figure 8. User 3 Join the Subgroup
Figure 9. User4 join the Subgroup
Figure 10. User2 leave from the Subgroup
2.4.2. Member Leave
When a user leaves (Fig.11.) from the Subgroup, then the Subgroup controller changes its
private key. After that, it broadcasts its new public key value to all users in the Subgroup. Then,
new Subgroup key will be generated. Let us consider, User B is going to leave, then the
Subgroup Controller D changes its private key nD’ =43297 ,so public key of User A & User C
=(198,139)$(136,11). Then the new Subgroup Key generated is = 43297(198,139) = (207,115).
Then, User A & User C computes the new Subgroup Key by using new public key. Therefore,
the new Subgroup Key is (207,115). The implementation is shown in figure.10.
2.4.3. Group Controller Leave
When a Subgroup controller leaves (Fig.12.) from the group, then the previous Subgroup
controller changes its private key. After that, it broadcasts its new public key value to all users in
the group. Then, new Subgroup key will be generated. Let us consider, Subgroup Controller
User D going to leave, then the previous Subgroup controller User C act as Subgroup Controller
and changes its private key nC’ = 52898 , and computes the public key of B&C $ A&C =
(16,111)$(181,2). Then the new Subgroup Key generated is = 52898(21,103) = (198,139). Then,
User A & User B compute the new Subgroup Key by using new public key. Therefore, the new
Subgroup Key is (198,139). The implementation is shown in figure.13.
9. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
18
Figure.11. User –B leave from the
Group. Figure.12. Group Controller Leave
from the group.
Figure 13. Subgroup Controller Leave from
the Subgroup Figure 14. User 1 and User 2 Join the Outer
group using TECGDH
2.5. Tree-based Group Elliptic Curve Diffie-Hellman Protocol
The proposed protocol (Fig.15.), Tree-based group Elliptic Curve Diffie-Hellman
(TGECDH), is a variant of TGDH based on ECDLP. In TGECDH, a binary tree is used to
organize group members. The nodes are denoted as < l, v >, where l
0 v 2 1≤ ≤ − since
each level l hosts at most 2l
nodes and <l,v> means the v-th node at the l-th level on the key tree.
Each node < l, v > is associated with the key K<l,v> and the blinded key BK<l,v> = F(K<l,v>) where
the function F() is scalar multiplication of elliptic curve points in prime field. Assuming a leaf
node < l, v > hosts the member Mi, the node < l, v > has Mi’s session random key K<l,v>.
Furthermore, the member Mi at node < l. v > knows every key in the key-path from < l, v > to
< 0, 0 >. Every key K<l,v> is computed recursively as follows:
, 1,2 1,2 1 modl v l v l vK K BK p< > < + > < + + >=
1,2 1 1,2 modl v l vK BK p< + + > < + >=
1,2 1,2 1 modl v l vK K G p< + > < + + >=
1,2 1,2 1( )l v l vF K K< + > < + + >=
(1)
Figure.15. Key Tree. Figure.16. User M1 & M2 Join the Group
10. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
19
It is not necessary for the blind key BK<l,v> of each node to be reversible. Thus, simply
use the x-coordinate of K<l,v> as the blind key. The group session key can be derived from
K<0,0>. Each time when there is member join/leave, the outer group controller node calculates
the group session key first and then broadcasts the new blind keys to the entire group and
finally the remaining group members can generate the group session key.
2.5.1. When node M1&M2 Join the group.
User M1 and User M2 are going to exchange their keys: Take p=751, Ep(1,188) , which
is equivalent to the curve y2
=x3
+x+188 and G = (0,376). User M1’s private key is 1772, so
M1’s public key is (290,638). User M2’s private key is 1949, so M2’s public key is (504,163) .
The Outer Group key is computed (Figure.16) as User M1 sends its public key (290,638) to
user M2, the User M2 computes their group key as PV(0,0) = Xco (PV(1,0) *PB(1,1)) and
PB(0,0) = PV(0,0)*G =(540,111). Similarly, User M2 sends its public key (504,163) to user M1,
and then the user M1 computes their group key as (540,111). Here, Outer Group controller is
User M2. The implementation is shown in figure.14.
2.5.2. When 3rd
node Join
When User M3 joins the group, the old Outer group controller M2 changes its private
key value from 1949 to 2835 and passes the public key value and tree to User M3. Now, M3
becomes new Outer group controller. Then, M3 generates the public key (623, 52) from its
private key as 14755 and computes the Outer group key as (664,736) shown in Figure.17. M3
sends Tree and public key to all users. Now, user M1 and M2 compute their group key. The
same procedure is followed by joining the User M4 as shown in Fig.18. The implementation is
shown in figure 19 and 20.
Figure.17. User M3 Join the Group Figure.18. User M4 Join the group
Figure 19. User 3 joins the Outer group Figure 20. User 4 Joins the Outer group
2.5.3. Leave Protocol
There are two types of leave. 1. Gateway Member Leave and 2.Outer Group Controller
Leave
11. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
20
1. Gateway Member Leave
When user M3 leaves (Figure.21) the Outer group, then the Outer Group controller changes
its private key 48569 to 98418 and outer group key is recalculated as (428,686). After that, it
broadcasts its Tree and public key value to all users in the Outer group. Then, the new Outer
group key will be generated by the remaining users. The implementation is shown in figure.23.
2. When an Outer Group Controller Leaves
When an Outer Group Controller Leaves (Figure.22) from the group, then its sibling act as a
New Outer Group Controller and changes its private key value 8751 to 19478 and recalculates
the group key as (681,475). After that, it broadcast its Tree and public key value to all users in
the Outer group. Then, the new Outer group key will be generated by the remaining users. The
implementation is shown in figure 24.
Figure.21. User M3 Leave from the
Outer Group
Figure.22. Outer Group Controller Leave
from the Outer Group
Figure 23. User 3 leave from the Outer
group
Figure 24. Outer group controller leave
from the Outer group
3. MESSAGE ENCRYPTION AND DECRYPTION
Elliptic curve cryptography can be used to encrypt plaintext message, M, into
ciphertexts. The plaintext message M is encoded into a message point PM from the finite set of
points in the elliptic group, Ep(a,b). For example, User send the information to other user , first
selects a random integer kA<n and computes kAG and kASK. To encrypt the message PM to
compute the ciphertext pair of points Pc:
PC = [(kA G), (PM + kA SK)] (2)
After receiving the ciphertext pair of points, PC, the receiver multiplies the first point,
(kA G) with its shared secrect key, SK and then adds the result to the second point in the
ciphertext pair of points, (PM+kASK):
12. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
21
(PM+ kA SK) – [SK (kAG)] = PM + kASK – kASK = PM (3)
This is the plaintext point, corresponding to the plaintext message M.
Similarly, the gateway member received the message, first perform the decryption with
subgroup key and then encrypt with outer group key KG. Other gateway members first decrypt
the message with outer group key KG and then encrypt with its subgroup key SK.
Consider the example for message encryption and decryption.
3.1. Message Encryption:
Message : dh1.png
Random Number KA : 75
Cipher Text Pc = ( KAG, PM+KASK)
KAG =75 G =75 mod 241 =(32,108)
PM
d 100 (93,77)
h 104 (163,50)
1 49 (207,96)
. 46 (83,124)
p 112 (58,12)
n 110 (164,197)
g 103 (67,154)
Sk= (155,115)=229 G
KASK =75*229 G= 64 G
PM+KASK
d → (100+64) mod 241 = (16,100)
h → (104+64) mod 241 = (72,197)
1 → (49+64) mod 241 = (133,163)
. → (46+64) mod 241 = (164,197)
p → (112+64) mod 241 = (12,205)
n → (110+64) mod 241 = (131,84)
g → (103+64) mod 241 = (167,181)
Therefore,
Pc = (32,108): (16,100):(72,197):(133,163):(164,197):(12,205) ):(131,84) ):(167,181)
3.2. Message Decryption:
The Subgroup Key (Sk) is (155,115)
Random no. Chosen can be found by the KAG Value (32,108)
From (32,108) we may trace the value KA as 75.
Sk= (155,115) =229 G
KASK = 75*229G =64
13. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
22
1) PM+KASK = (16,100)
PM= (16,100) -KASK = (16,100) - 64 = 164 –64 = 100 G => (93,77) d
(2) PM+KASK = (72,197)
PM = (72,197) - KASK = (72,197) - 64 = 168 – 64 = 104 G => (163,50) h
(3) PM+KASK = (133,163)
PM = (133,163) - KASK = (133,163) - 64 = 103 – 64 = 49 G => (207,96) 1
(4) PM+KASK = (164,197)
PM = (164,197) - KASK (164,197) -64 = 110 – 64 = 46 G => (83,124) .
(5) PM+KASK = (12,205)
PM = (12,205) - KASK = (12,205) – 64 = 176 –64 = 112G => (58,12) p
(6) PM+KASK = (131,84)
PM = (131,84) - KASK = (131,84)– 64 = 174 –64 = 110G => (164,197) n
(7) PM+KASK = (167,181)
PM = (167,181) - KASK = (167,181) – 64 = 167 –64 = 103G => (67,154) g
Therefore decrypted message is dh1.png. The implementation is shown in figure 25.
Figure 25. Message Encryption
.
4. EXPERIMENTAL RESULTS AND DISCUSSION
The experiments were conducted on a Ad-Hoc System (Laptop) running on a 2.4 GHz
Pentium CPU, with 2GB of Memory and 802.11 b/g 108 Mbps Super G PCI wireless cards with
Atheros chipset. To test this project in a more realistic environment, the implementation is done
by using Java, in an ad hoc network where users can securely share their data. This project
integrates with a peer-to-peer (P2P) communication module that is able to communicate and
share their messages with other users in the network which is described below.
4.1. Searching for information [4, 5, and 6].
a) Transferring information within the same peer group:
When the peer group G is in need of searching for any messages within its members (Pi),
it needs to send a query message to all the members of G (i.e Pi) . Each peer, Pj in G, that
14. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
23
receives the query message, checks whether any items match the query and responds
directly to Pi with a query response message that contains the metadata associated with
the items that matched the query.
b) Transferring information between peers:
A peer Pi may request a transfer of information from a peer Pj, by sending a transfer
request message to Pj. Pj, upon receiving this message checks whether it has the
information item associated with the request. If Pj has the item then Pj transfers the
requested information to Pi.
4.2. Local Region View
After the establishment of ECRBGKA protocol, the requested peer system files are
displayed as shown in the figure.26.
Fig.26.Local Regional view
4.3. Normal Search
As soon as the filename is entered and search button gets clicked, the path of the searched
file will be enlisted and the desired file can be obtained in a fraction of time. Normal file search
is performed as shown in the figure.27.
Fig.27. Normal Search
15. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
24
4.4. Content Search:
In this kind of search, when we give a content of a file, all files which have that content will
be display instantly after clicking over the search button. Content search is performed as shown
in the figure 28.
Fig.28. Content Search
5. PERFORMANCE ANALYSIS
The performance of the proposed scheme is analyzed in terms of the storage overhead,
communication overhead and the computation overhead.
5.1. Storage overhead
Storage overhead can be considered as the memory capacity required for maintaining the
keys, which is directly proportional to the number of members if the key size are same. In this
section, the storage cost is formulated, both at gateway member and at each member. Thus our
approach consumes very less memory when compared to TGDH and GDH. TGDH and GDH
occupy large memory when members go on increasing. But our Region-based Approach takes
very less memory even when the members get increased. Consider (Figure- 29) there are 1024
members in a group our Region-based approach consumes 10% of memory when compared to
GDH and 5% when compared to TGDH. The ratio of memory occupied is very less in our
approach.
Figure.29. Memory Cost
16. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
25
5.2. Communication Overhead:
GDH is the most expensive protocol. TGDH consumes more bandwidth. The
Communication and computation of TGDH depends on trees height, balance of key tree,
location of joining tree, and leaving nodes. Hence GDH has more communication efficiency
than TGDH protocol. But our approach depends on the number of members in the subgroup,
number of Group Controllers, and height of tree. So the amount spent on communication is very
much less when compared to GDH and TGDH.
Consider (Figure.30&31) there are 512 members in a group our approach consumes
only 10% of Bandwidth when compared to GDH and TGDH. So our approach consumes low
Bandwidth.
Figure.30. Communication Cost – Join
Figure.31. Communication Cost - Leave
5.3. Computation Overhead:
The figure.32 shows that Group Elliptic Curve Diffie-Hellman (GECDH)& Tree based
Group Elliptic Curve Diffie-Hellman schemes have lower computation time than Group Diffie-
Hellman (GDH) schemes for member join operations. The computation time of GDH is 2.2
times that of GECDH and TGDH is 1.7 times that of TGECDH on average for member join
operations. The computation time for member leave operations of TGECDH schemes are far
better than group Diffie-Hellman schemes for member leave operations as shown in the
17. International Journal of peer
figure.33. Performance wise our approach
the very large groups.
Figure.32. Computation time for Member Join
Figure.3
The performance of GECDH&TGECDH over wireless ad hoc Networks can be summarized
as follows:
It uses smaller keys.
It uses less computation time than the DLP
Smaller packets are used to handle high bit error rate
6. CONCLUSION AND FUTURE WORK
In this paper, we propose and evaluate a new ECDLP
secure Peer –to- Peer Information sharing in mobile ad hoc networks. The experiment results
show that ECRBGKA scheme is the best protocol in terms of overall pe
Peer –to- Peer Information sharing in mobile ad hoc ne
retrieval is most efficient if the group members have a common, shared key for securing the
communication. Region-Based
provides efficient, distributed, mechanisms fo
generates a new key every time a membership change occurs to preserve forward secrecy. We
have presented a Region-Based GKA of security mechanisms that can be used to
based security for Peer-to- Peer information sharing. Our solutions are based on established and
proven security techniques and we utilize existing technologies. We make use of these
International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
. Performance wise our approach performs better than GDH&TGDH methods, even for
. Computation time for Member Join
Figure.33 .Computation time for Member Leave
The performance of GECDH&TGECDH over wireless ad hoc Networks can be summarized
It uses less computation time than the DLP-based scheme for the same security level.
Smaller packets are used to handle high bit error rate in Wireless links.
UTURE WORK
In this paper, we propose and evaluate a new ECDLP-based Diffie-Hellman protocols for
eer Information sharing in mobile ad hoc networks. The experiment results
show that ECRBGKA scheme is the best protocol in terms of overall performance for secure
eer Information sharing in mobile ad hoc networks. Secure group information
retrieval is most efficient if the group members have a common, shared key for securing the
Based Group Key Agreement in Peer-to-Peer Information sharing
provides efficient, distributed, mechanisms for re-keying in case of dynamic groups, which
generates a new key every time a membership change occurs to preserve forward secrecy. We
Based GKA of security mechanisms that can be used to provide ECC
information sharing. Our solutions are based on established and
proven security techniques and we utilize existing technologies. We make use of these
2010
26
GDH methods, even for
The performance of GECDH&TGECDH over wireless ad hoc Networks can be summarized
based scheme for the same security level.
protocols for
eer Information sharing in mobile ad hoc networks. The experiment results
rformance for secure
tworks. Secure group information
retrieval is most efficient if the group members have a common, shared key for securing the
eer Information sharing
keying in case of dynamic groups, which
generates a new key every time a membership change occurs to preserve forward secrecy. We
provide ECC
information sharing. Our solutions are based on established and
proven security techniques and we utilize existing technologies. We make use of these
18. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
27
mechanisms to provide efficient, scalable and secure delivery of queries and responses. Our
future work will unsolve formalizing these protocols.
REFERENCES
[1] Amir.Y, Kim.Y, Nita-Rotaru.C, Schultz.J, J.Stanton, and Tsudik.G , “Exploring Robustness in
Group Key Agreement,” Proc. 21st
IEEE Int’l Conf. Distributed Computing Systems, pp. 399-408(2001).
[2] Kefa Rabah , “Theory and Implementation of Elliptic Curve Cryptography, Journal of Applied
Sciences 5(4),604-633(,2005).
[3] Steiner.M, Tsudik.G, and Waidner.M, “ Key Agreement in Dynamic Peer Groups”, IEEE Trans.
Parallel and Distributed Systems, vol. 11, no.8,( Aug.2000).
[4] H. Jin, X. Ning, and H. Chen, (2006)“Efficient Search for Peer-to-Peer Information Retrieval Using
Semantic Small World,” Proc. 15th
Int’l Conf. World Wide Web (WWW ’06), pp. 1003-1004( May 2006)
[5] .Yun Zhou W. Bruce Croft Brian Neil Levine(2004) “Content-based search in peer-to-peer networks”
Dept. of Computer Science , University of Massachusetts, Amherst, MA 01003
[6] .Karlo Berket, Abdelilah Essiari and Artur Muratas,” PKI-Based Security for Peer-to-Peer Information
Sharing” Fourth International Conference on Peer-to-Peer Computing, 25-27 Aug. (2004)
[7]. William Stallings,” Cryptography and network security principles and practices”, Third Edition,
Pearson education
Authors :
Government College of Technology, Coimbatore,
Anna University Chennai, India, in 2005. He is an
Asst.Professor in the Department of Computer
Science and Engineering, Government College of
Engineering, Bargur, Tamil Nadu, India. Currently
he is working towards Ph.D. in Computer Science
and Engineering from the Anna University,
Coimbatore. He has presented a number of papers
in various National and International conferences.
Many of his papers were published in IEEE
Explore and Springer. He has to his credit Five
International Journal Publications in reputed
journals. His research interests include Network
Security, Cryptography, Ad Hoc Networks,
Distributed System, Peer-to-Peer systems, Wireless
Security and Multimedia security.
Kumar. K received the B.E.
Degree in Computer Science
and Engineering from the
University of Madras, Tamil
Nadu, India, in 1999, M.E.
Degree in Computer Science
and Engineering from
19. International Journal of peer-to-peer networks (IJP2P) Vol.1, No.1, October 2010
28
She has over 15 years of Teaching Experience.
She did her B.E (Computer Science and
Engineering) Degree in 1995 from University of
Madras and M.E (Computer Science and
Engineering) Degree in 2005 from Anna
University, Chennai. She is currently pursuing her
doctoral programme. Her research interest
includes Access Control, Steganography, Network
security , Cryptography and Applied Mathematics.
She has published in about five international
journals and has presented papers in about 5
International Conferences .Two of her papers has
been indexed in IEEE Explore.
Anna University Chennai. She is presently guiding
10 Research Scholars for their Research Works.
She has to her credit many International and
National journal Publications .Many of her papers
were published in IEEE Explore, Elsevier and
Springer. Her research interests include Ad Hoc
Networks, Wireless Security and Cryptography.
Nafeesa Begum: Jeddy
Nafeesa Begum is
presently working
as Assistant Professor
(Senior Grade) in
Government College of
Engineering, Bargur,
Krishnagiri District
.Tamil Nadu.
Dr.V.Sumathy is presently
working as Associate
Professor in Government
College of Technology,
Coimbatore, Tamil Nadu,
India. She did her B.E and
M.E Degree from Bharathiar
University in 1988, 2000.
Ph.D Degree in 2007 from