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 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.
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.
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.
Elliptic Curve for Secure Group Key Management in Distributed Networkijceronline
Group communication emphasis an important security criterion in the design of a distributed network. All the members of the group must agree to a common session key. The management of this session key refers to the group key management which is based on some group key agreement protocol. In this paper we propose a group key management method for secure group communication in a distributed network. Frequent change in group membership, and managing the key distribution for new members are the two main problems to be faced in group communication that too with minimal computation and communication overhead. Our system uses the concept of Elliptic curve Cryptography that provide same level of security as that of other cryptosysytems with reduced key size. This results in less re-keying and re-distribution operations, thus reducing computation and communication overheads respectively
A 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.
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.
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.
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
Identity-Based Key Management in MANETs Using Public Key CryptographyCSCJournals
Wireless mobile Ad Hoc Networks (MANETs) are an emerging area of mobile computing. MANETs face serious security problems due to their unique characteristics such as mobility, dynamic topology and lack of central infrastructure support. In conventional networks, deploying a robust and reliable security scheme such as Public Key Infrastructure (PKI) requires a central authority or trusted third party to provide fundamental security services including digital certificates, authentication and encryption. In the proposed scheme, a secure identity-based key management scheme is proposed for networks in environments without any PKI. This scheme solved the security problem in the MANET and is suitable for application to other wired network structures
ENHANCED INTEGRITY AUDITING FOR DYNAMIC AND SECURE GROUP SHARING IN PUBLIC CLOUDIAEME Publication
The challenge faced in public cloud computing is to provide privacy and security to the data shared among the group members. In this paper, an enhanced secure group sharing framework has been proposed. As the cloud has a semi-trust relationship it is in need of a security model so that no classified information is being presented to cloud suppliers and aggressors. Another critical variable in giving protection and security is a periodical evacuation of undesirable records which if not done consistently then, might turn into a piece of enthusiasm for assailants and can be abused. By applying the proxy signature procedure, the grouping pioneer can adequately concede the benefit of grouping administration to one or more grouped individuals.
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
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.
ARTIFICIAL NEURAL CRYPTOGRAPHY DATAGRAM HIDING TECHNIQUES FOR COMPUTER SECURI...IAEME Publication
Cryptography is the scientific study of mathematical and algorithmic techniques relating to information security. Cryptographic techniques will help to protect information in cases where an attacker can have physical access to the bits representing the information, ex. When the information has to be sent over a communication channel that can be eaves dropped on by an attacker. Cryptographic primitives are the basic building blocks for constructing cryptographic solutions to information protection problems. A cryptographic primitive consists of one or more algorithms that achieve a number of protection goals. There is no well-agreed upon complete list of cryptographic primitives, nor are all cryptographic primitives independent, it is often possible to realize one primitive using a combination of other primitives.
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
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.
UNIT - 1
Services, mechanisms and attacks, The OSI security architecture, A model for
network security.
TEXT BOOK:
1. Cryptography and Network Security, William Stalling, Pearson Education, 2003.
REFERENCE BOOKS:
1. Cryptography and Network Security, Behrouz A. Forouzan, TMH, 2007.
2. Cryptography and Network Security, Atul Kahate, TMH, 2003.
Comparative analysis of authentication and authorization security in distribu...eSAT Journals
Abstract In this paper different types of processes of authentication and authorization analyzed individually in a comparative way. Some time it may be seen that one process is complementary with another process so comparative analysis can detect why they are complement. Bringing a best output such as low cost, saving time, high confidentiality, adaptability etc are the results of this paper. This thesis has concluded with some recommendations that several security processes of authentication and authorization might be suitable for some in distributed system to replace the wired processes. Keywords: Authentication security, Authorization security, Access control, Security in distributed system
NETWORK SECURITY
UNIT - 1
Services, mechanisms and attacks, The OSI security architecture, A model for network security. 6 Hrs
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher. 7 Hrs
UNIT - 3
Principles of Public-Key Cryptosystems, The RSA algorithm, Key Management, Diffie - Hellman Key Exchange, Elliptic Curve Arithmetic, Authentication functions, Hash Functions. 6 Hrs
UNIT - 4
Digital signatures, Authentication Protocols, Digital Signature Standard. 7 Hrs
UNIT - 5
Web Security Consideration, Security socket layer (SSL) and Transport layer security, Secure Electronic Transaction. 6 Hrs
UNIT - 6
Intruders, Intrusion Detection, Password Management. 6 Hrs
UNIT - 7
MALICIOUS SOFTWARE: Viruses and Related Threats, Virus Countermeasures. 7 Hrs
UNIT - 8
Firewalls Design Principles, Trusted Systems. 6 Hrs
TEXT BOOK:
1. Cryptography and Network Security, William Stalling, Pearson Education, 2003.
REFERENCE BOOKS:
1. Cryptography and Network Security, Behrouz A. Forouzan, TMH, 2007.
2. Cryptography and Network Security, Atul Kahate, TMH, 2003.
MINIMISATION OF KEY GENERATION OVERHEAD IN GROUP KEY MANAGEMENT WITH MODULAR ...IJCI JOURNAL
Multicast communication experiences recipient get to issue due to forward secrecy, backward secrecy. The group key management is a productive component to handle this circumstance. Be that as it may, there are numerous entities which impact the communication, computation overhead, message size, storage overhead and so forth. There are we require proficient group key management path to deal with secure the frame function and decrease the overhead in the current approach by utilizing Key Graph. Exist key graph [7] proposed the augmentation of the double key tree to 4-ary key tree. 4-ary key tree beat the issue of reentering as far as height of the key tree. Using a greater degree reduces the height of the key tree and, as a result, improves re-keying performance with the help of Modular Function.
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.
Identity-Based Key Management in MANETs Using Public Key CryptographyCSCJournals
Wireless mobile Ad Hoc Networks (MANETs) are an emerging area of mobile computing. MANETs face serious security problems due to their unique characteristics such as mobility, dynamic topology and lack of central infrastructure support. In conventional networks, deploying a robust and reliable security scheme such as Public Key Infrastructure (PKI) requires a central authority or trusted third party to provide fundamental security services including digital certificates, authentication and encryption. In the proposed scheme, a secure identity-based key management scheme is proposed for networks in environments without any PKI. This scheme solved the security problem in the MANET and is suitable for application to other wired network structures
ENHANCED INTEGRITY AUDITING FOR DYNAMIC AND SECURE GROUP SHARING IN PUBLIC CLOUDIAEME Publication
The challenge faced in public cloud computing is to provide privacy and security to the data shared among the group members. In this paper, an enhanced secure group sharing framework has been proposed. As the cloud has a semi-trust relationship it is in need of a security model so that no classified information is being presented to cloud suppliers and aggressors. Another critical variable in giving protection and security is a periodical evacuation of undesirable records which if not done consistently then, might turn into a piece of enthusiasm for assailants and can be abused. By applying the proxy signature procedure, the grouping pioneer can adequately concede the benefit of grouping administration to one or more grouped individuals.
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
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.
ARTIFICIAL NEURAL CRYPTOGRAPHY DATAGRAM HIDING TECHNIQUES FOR COMPUTER SECURI...IAEME Publication
Cryptography is the scientific study of mathematical and algorithmic techniques relating to information security. Cryptographic techniques will help to protect information in cases where an attacker can have physical access to the bits representing the information, ex. When the information has to be sent over a communication channel that can be eaves dropped on by an attacker. Cryptographic primitives are the basic building blocks for constructing cryptographic solutions to information protection problems. A cryptographic primitive consists of one or more algorithms that achieve a number of protection goals. There is no well-agreed upon complete list of cryptographic primitives, nor are all cryptographic primitives independent, it is often possible to realize one primitive using a combination of other primitives.
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
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.
UNIT - 1
Services, mechanisms and attacks, The OSI security architecture, A model for
network security.
TEXT BOOK:
1. Cryptography and Network Security, William Stalling, Pearson Education, 2003.
REFERENCE BOOKS:
1. Cryptography and Network Security, Behrouz A. Forouzan, TMH, 2007.
2. Cryptography and Network Security, Atul Kahate, TMH, 2003.
Comparative analysis of authentication and authorization security in distribu...eSAT Journals
Abstract In this paper different types of processes of authentication and authorization analyzed individually in a comparative way. Some time it may be seen that one process is complementary with another process so comparative analysis can detect why they are complement. Bringing a best output such as low cost, saving time, high confidentiality, adaptability etc are the results of this paper. This thesis has concluded with some recommendations that several security processes of authentication and authorization might be suitable for some in distributed system to replace the wired processes. Keywords: Authentication security, Authorization security, Access control, Security in distributed system
NETWORK SECURITY
UNIT - 1
Services, mechanisms and attacks, The OSI security architecture, A model for network security. 6 Hrs
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher. 7 Hrs
UNIT - 3
Principles of Public-Key Cryptosystems, The RSA algorithm, Key Management, Diffie - Hellman Key Exchange, Elliptic Curve Arithmetic, Authentication functions, Hash Functions. 6 Hrs
UNIT - 4
Digital signatures, Authentication Protocols, Digital Signature Standard. 7 Hrs
UNIT - 5
Web Security Consideration, Security socket layer (SSL) and Transport layer security, Secure Electronic Transaction. 6 Hrs
UNIT - 6
Intruders, Intrusion Detection, Password Management. 6 Hrs
UNIT - 7
MALICIOUS SOFTWARE: Viruses and Related Threats, Virus Countermeasures. 7 Hrs
UNIT - 8
Firewalls Design Principles, Trusted Systems. 6 Hrs
TEXT BOOK:
1. Cryptography and Network Security, William Stalling, Pearson Education, 2003.
REFERENCE BOOKS:
1. Cryptography and Network Security, Behrouz A. Forouzan, TMH, 2007.
2. Cryptography and Network Security, Atul Kahate, TMH, 2003.
MINIMISATION OF KEY GENERATION OVERHEAD IN GROUP KEY MANAGEMENT WITH MODULAR ...IJCI JOURNAL
Multicast communication experiences recipient get to issue due to forward secrecy, backward secrecy. The group key management is a productive component to handle this circumstance. Be that as it may, there are numerous entities which impact the communication, computation overhead, message size, storage overhead and so forth. There are we require proficient group key management path to deal with secure the frame function and decrease the overhead in the current approach by utilizing Key Graph. Exist key graph [7] proposed the augmentation of the double key tree to 4-ary key tree. 4-ary key tree beat the issue of reentering as far as height of the key tree. Using a greater degree reduces the height of the key tree and, as a result, improves re-keying performance with the help of Modular Function.
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.
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
Secure Group Communication in Grid EnvironmentCSCJournals
A Grid is a collection of resources that are available for an application to perform tasks. Grid resources are heterogeneous, geographically distributed and belong to different administrative domains. Hence security is a major concern in a grid system. Authentication, message integrity and confidentiality are the major concerns in grid security. Secure group communication is brought about by effective key distribution to authenticated users of the channels serviced by resources. The proposed approach facilitates reduced computation and efficient group communication. It also ensures efficient rekeying for each communication session. The security protocol has been implemented and tested using Globus middleware.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing
A Review on Key-Aggregate Cryptosystem for Climbable Knowledge Sharing in Clo...Editor IJCATR
The Data sharing is an important functionality in cloud storage. In this article, we show how to securely, efficiently, and
flexibly share data with others in cloud storage. We describe new public-key cryptosystems which produce constant-size ciphertexts
such that efficient delegation of decryption rights for any set of ciphertexts are possible. The novelty is that one can aggregate any set
of secret keys and make them as compact as a single key, but encompassing the power of all the keys being aggregated. In other
words, the secret key holder can release a constant-size aggregate key for flexible choices of ciphertext set in cloud storage, but the
other encrypted files outside the set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in
a smart card with very limited secure storage. We provide formal security analysis of our schemes in the standard model. We also
describe other application of our schemes. In particular, our schemes give the first public-key patient controlled encryption for flexible
hierarchy, which was yet to be known.
Improving Efficiency of Security in Multi-CloudIJTET Journal
Abstract--Due to risk in service availability failure and the possibilities of malicious insiders in the single cloud, a movement towards “Multi-clouds” has emerged recently. In general a multi-cloud security system there is a possibility for third party to access the user files. Ensuring security in this stage has become tedious since, most of the activities are done in network. In this paper, an enhanced security methodology has been introduced in order to make the data stored in cloud more secure. Duple authentication process introduced in this concept defends malicious insiders and shields the private data. Various disadvantages in traditional systems like unauthorized access, hacking have been overcome in this proposed system and a comparison made with the traditional systems in terms of performance and computational time have shown better results.
A NEW COMMUNICATION PLATFORM FOR DATA TRANSMISSION IN VIRTUAL PRIVATE NETWORKijmnct
Nowadays security is an evident matter in designing networks and much research has been done in this
field. The main purpose of the research is to provide an appropriate instruction for data transmission in a
reliable platform. One of the instructions of transferring information is to use public networks like internet.
The main purpose of the present paper is to introduce that enables the users to enter to a new security level.
In this paper, VPN as one of the different instructions for establishing the security proposed to be
examined. In this type, tunneling method of internet protocol security (IPsec) is used. Furthermore, the
advanced method of scanning fingerprint is applied to establish authentication and Diffie-Hellman
algorithm for coding and decoding data, of course with conversion in this algorithm.
Enhanced security for non English users of Wireless Sensor NetworksEswar Publications
Wireless Sensor Networks is an infrastructure less, self-configured, reprogrammable, energy-aware network used
in various applications. Many networks works on security of data including mainly ASCII values but not the non English end users. BDNA cryptography describes how to encrypt non English patterns but which leads to propagation of more bits transmitted means indirectly consumes more energy in WSN. In this we propose new steps to reduce the transmission of more bytes in the network. This gives high propagation speed in the network with minimum hash overhead.
SURVEY AND TAXONOMY OF KEY MANAGEMENT PROTOCOLS FOR WIRED AND WIRELESS NETWORKSIJNSA Journal
The purpose of this paper is to survey the key management protocols for wired and wireless networks and study their security aspects in terms of key generation, agreement and distribution. The central research challenge is exhaustive survey of secure and efficient key management protocols. In this survey, it is shown that all these protocols could be placed under one of two key management protocol categories: (i)
peer to peer communication and (ii) group communication. This can also be analyzed that peer to peer key management can be classified as: (i) symmetric key, (ii) asymmetric key and (iii) hybrid key management protocols and group communication can further be classified as: (i) Diffie-Hellman based (ii)Hybrid key management. We can say that our theoretical and execution analysis of protocols emphasise various observations that can motivate researchers in key management issues of networks.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
2. 176 Computer Science & Information Technology (CS & IT)
read only by an authorized and intended receiver. Hence, the confidential data is secured in an
efficient way which is not tampered by unauthorized users.
To provide a secure group communication, it is necessary to manage the keys for creating,
updating and distribution. Moreover, before exchanging the confidential data, the key
establishment protocol has to distribute the group key to all participating entities in a secured and
effective manner. The two important types of key establishment protocols are namely key transfer
protocols and key agreement protocols. Key transfer protocols rely on KGC to select group key
for communicating information with the group members by sharing one or more secret key
during registration. But in key agreement protocols, the group key is determined by exchanging
public keys of two communication parties with the presence of communication entities.
The most commonly used key agreement protocol is Diffie-Hellman (DH) key agreement
protocol [4]. However, the Diffie Hellman key distribution algorithm can provide secret key only
for two entities, and cannot provide secret keys for the group that has more than two members.
When there are a more number of members in a group the time delay for setting up the group key
will take longer time. Hence, it is necessary to propose a new technique to avoid this type of
constraints in group communication. In this proposed work, group communication applications
will make use of key transfer protocol to transmit data to all the group members with the
minimum resources needed for this group communication.
In this work, a cryptographic technique for secure key distribution and key management in the
group environment is proposed. The algorithms are analyzed with suitable samples. The
remaining paper is organized as follows. Chapter 2 surveys about the existing work in this area.
Chapter 3 explores the proposed work and the implementation details. Chapter 4 and Chapter 5
analyzes and discusses the results obtained from the work. Chapter 6 discuss about the security
analysis. Chapter 7 concludes the proposed and implemented work and suggested some possible
enhancements.
2. LITERATURE SURVEY
There are many works pertaining to the secure Group Communication and that have been carried
out, but some of the important works has been surveyed and cited here. Among them, Mike
Burmester and Yvo Desmedt [3] presented a Group Key Exchange protocol which extends the
Diffie-Hellman protocol [2]. The protocol is scalable and secure against passive attacks. But,
Diffie Hellman public key distribution algorithm is able to provide group key only for two
entities. Bohli [4] developed a framework for robust group key agreement that provides security
against malicious insiders and active adversaries in an unauthenticated point-to-point network.
Bresson et al. [13] constructed a generic authenticated group Diffie-Hellman key exchange
algorithm which is more secure. Katz and Yung [5] proposed the first constant-round and fully
scalable group Diffie-Hellman protocol which is provably secure. There are many other works
related to group key management protocols based on non-DH key agreement approaches. Among
them, Tzeng [9] presented a conference key agreement protocol that relies on discrete algorithm
assumption with fault tolerance. This protocol establishes a conference key even if there is
several numbers of malicious participants in the conference. Hence, this method is not suitable
for group communication.
Moreover, in a centralized group key management, there is only one trusted entity responsible for
managing the entire group. Hence, the group controller need not depend on any auxiliary entity to
perform key distribution. Harney et al. [10] proposed a group key management protocol that
requires O(n) where n is the size of group, for encrypting and update a group key when a user is
evicted or added in backward and forward secrecy.
3. Computer Science & Information Technology (CS & IT) 177
Eltoweissy et al.[6] developed a protocol based on Exclusion Basis Systems (EBS), a
combinatory formulation for the group key management problem. Lein Harn and Changlu Lin [1]
introduced a group key transfer protocol where members of the group fully rely on Key
Generation Center (KGC). They proposed an authenticated key transfer protocol based on secret
sharing scheme that KGC can broadcast group key information to all group members at once.
Chin-Yin Lee et al. [7] addressed the security issues and drawback associated with existing group
key establishment protocols. They have also used secret sharing scheme to propose a secure key
transfer protocol to exclude impersonators from accessing the group communication. Their
protocol can resist potential attack and also reduce the overhead of system implementation.
Burmester et.al [11] has presented a practical conference key distribution systems based on
public-keys and also authenticates the users.
3. PROPOSED WORK
Based on the above survey in this secure group communication, it is necessary to propose a new
model to solve the identified issues. The proposed model consists of four processes namely the
User Registration, Group key generation based on prime numbers, Key generation and Key
distribution, Group re-keying. The four main processes are explained as below.
3.1. User Registration
This module explains the process of User Registration. Each user has to register their identity at
KGC for subscribing the key distribution service. While legitimate entities register to KGC, the
encrypted hash value of their password is stored in the authentication server. Hence, this
approach initially authenticates the user by matching its encrypted hash value with that of the
stored value. The hash value of the password is calculated using Message Digest (MD5)
algorithm and the encrypted password is stored in the authentication file. KGC keeps track of all
registered users and removes any unsubscribed users in the group. During registration process,
each user mi is required to share a random secret value Si with the KGC. Once user registration
process is completed, KGC assigns a permanent secret id, denoted by Pi for each member mi in
the group
3.2. Group Key Generation and Distribution
Whenever there is a group of users participating in a group communication, the Key Generation
Center (KGC) will select a random group key K > (Pi ⊕ Si) for all i of Group G and computes
the message (Xi, Yi) pairs in the following manner.
Xi = K / (Pi ⊕ Si) (1)
Yi = K mod (Pi ⊕ Si) (2)
Once the pair is generated, KGC published (Xi, Yi). From this public information, each group
member mi can able to retrieve the key by computing
K = Xi * (P1 ⊕ S1) + Yi (3)
Only authorized member can able to retrieve the hidden key using this pair (Xi, Yi).
3.3 Group Re-keying
Scalable group re-keying is the important task to be performed when user joins or leaves the
group in the secure group communication. The group keys needs to be updated to maintain the
4. 178 Computer Science & Information Technology (CS & IT)
forward and backward secrecy. To achieve this, the two important tasks namely members join
and members leave operation is performed.
3.3.1 Member Join
When a member wants to join the system, the new member will register with the KGC. KGC will
share a prime number Pn+1 and the member will provide the secret id Sn+1 where K >(Pn+1 ⊕ Sn+1).
KGC generates the new pair of values (Xi, Yi) by using equation (1) and (2). After receiving the
(Xi, Yi) pairs, the newly joined member can use the prime number along with his secret id to
derive the key K from equation (3).
3.3.2 Member Leave
When a member leaves the system, the member should inform to the KGC. Now KGC generates
a new group key as follows. Step 1. KGC selects a new prime number K’ (where K’ > (P1 ⊕ S1)
for all i).
Step 2. New pair of values (Xi, Yi) are generated with the new Key K and distribute it to all the
group members.
Fig 1. Process of Key Generation
5. Computer Science & Information Technology (CS & IT) 179
4. EXPERIMENTAL SETUP
The proposed password based authenticated system is tested with five valid and five invalid
users. Each of the five valid users has their own username and password. Initially, the users have
created their username and password (Table 1). The authentication server stores the encrypted
hash values of the passwords. As the hash values of the passwords are different it ensures
uniqueness.
For key generation and key extraction mechanism, we considered a group with M=3 members.
Member1 has permanent secret id (Prime), P1=55837, Member2 has P2=55603, Member3 has
P3=35353, and key K= 65585.
The secret shared by each users are S1=28931, S2=37123, S3=12347. By applying equation (1)
of the pair generation by KGC, we generated the pair as
X1 = K / (P1 ⊕ S1) i.e 65585 / (55837⊕ 28931) = 1
Y1 = K mod (P1 ⊕ S1) i.e 65585 mod (55837⊕ 28931) = 21779
X2 = K / (P2 ⊕ S2) i.e 65585 / (55603⊕ 37123) = 3
Y2 = K mod (P2 ⊕ S2) i.e 65585 mod (55603⊕ 37123) = 10145
X3 = K / (P3 ⊕ S3) i.e 65585 / (35353⊕ 12347) = 1
Y3 = K mod (P3 ⊕ S3) i.e 65585 mod (35353⊕ 12347) = 17935
The generated pairs for the three members are (1, 21779), (3, 10145), (1, 17935). These pairs are
distributed to each member of the group. After receiving this message each member in the group
computes the key by using its pair as follows.
K1 = X1 * (P1 ⊕ S1) + Y1 i.e., 1 * 43806 + 21779 = 65585
K2 = X2 * (P2 ⊕ S2) + Y2 i.e., 3 * 18480 + 10145 = 65585
K3 = X3 * (P3 ⊕ S3) + Y1 i.e., 1 * 47650 + 17935 = 65585
We have taken K (Key) sizes as 64,128, 512, 1024 bits and the value of S (prime) has been taken
has 64, 128, 512 and 1024 bits. When a non-group member Mk attempts to compute the group
key with a unknown value pair it will not be able to retrieve the correct key.
5. PERFORMANCE ANALYSIS
The performance analysis for the password based authenticated module is analyzed with respect
to the number of valid and invalid users. The analysis of the work has been done under the
following heads
5.1 Md5 Analysis
The probability of two messages having the same message digest is on the order of 2^64
operations. The probability of coming up with any message having a given message digest is on
the order of 2^128 operations. This ensures uniqueness of the message digest.
5.2 Replay Attack
Usually replay attack is called as ‘man in the middle’ attack. Adversary stays in between the user
and the file and hacks the user credentials when the user contacts file. As key matching between
6. 180 Computer Science & Information Technology (CS & IT)
the users is checked before file transfer and the information is encrypted before transfer, the
probability of this attack is minimized.
Table 1. Authentication files with unique hash value passwords
5.3 Guessing Attack
Guessing attack is nothing but the adversaries just contacts the files byrandomly guessed
credentials. The effective possibility to overcome this attack is to choose the password by
maximum possible characters, so that the probability of guessing the correct password can be
reduced. As the proposed approach uses random generation of key, it is more difficult to guess
the password.
5.4 Stolen Verifier Attacks
Instead of storing the original password, the verifier of the password is stored. As the encrypted
hash value of the password is stored, the proposed protocol is also more robust against the attack.
6. SECURITY ANALYSIS
Given K , P and S, it is easy to compute
X= K / (P1 ⊕ S1) and Y= K mod (P1 ⊕ S1).
But given X and Y it is very difficult to compute K, in polynomial time, without knowing P and S
such that K = X * (P1 ⊕ S1) + Y, and it is NP hard for large size of K. Even if several pairs (Xi,
Yi) are known, it is very difficult to compute K, unless the corresponding Pi’s and Si’s are known.
Suppose,
K = X1 * (P1 ⊕ S1) + Y1 (P1 and S1 not known) (1)
K = X2 * (P2 ⊕ S2) + Y2 (P2 and S2 not known) (2)
K = X3 * (P3 ⊕ S3) + Y3 (P3 and S3 not known) (3)
K = X4 * (P4 ⊕ S4) + Y4 (P4 and S4 not known) (4)
From the first of two equations, we get
X1 * (P1 ⊕ S1) + Y1 = X2 * (P2 ⊕ S2) + Y2
X1 * (P1 ⊕ S1) - X2 * (P2 ⊕ S2) = Y2 – Y1 (say Y2> Y1)
X1 * (P1 ⊕ S1) – X2 * ((P1 ⊕ S1) + R1) = C1
Where (Y2 – Y1 = C1, (P2 ⊕ S2) = (P1 ⊕ S1) + R1)
(X1 – X2) (P1 ⊕ S1) - X2R1 = C1 (5)
S.no Username Password Hash Value
1 user1 admin 4c56ff4ce4aaf9573aa5dff913df913d
2 user2 Test2 Dfg45f4ce4aaf9573aa5dff913df913e
3 user3 test5 dddd6ffsdfdfdffffff913df997art567fg
4 user4 test8 4c56ff4ce4aaf9573aa5dff913df913d
5 user5 test10 sfggce4aaf9573aa5dff913df913fget
7. Computer Science & Information Technology (CS & IT) 181
Similarly from 1 and 3, we get
(X1 – X3) (P1 ⊕ S1) – X3R2 = C2 (6)
From 2 and 3, we get
(X2 - X3) (P2 ⊕ S2) – X3R3 = C3
(X2 - X3) ((P1 ⊕ S1) + R1) – X3R3 = C3
(X2 – X3) (P1 ⊕ S1) + (X2 – X3) R1-X3R3 = C3 (7)
Thus, there only 3 equations (5 – 7) to determine 5 unknowns (R1, R2, R3, P1 and S1), Therefore
one of the values R1, or R2 or R3 or P1 or S1will be left arbitrary, hence the value of K cannot be
determined easily and correctly.
The strength of the RSA algorithm relies on the fact that the given M (product of two large prime
numbers), it is not possible to find the two factors in polynomial time (It is NP-hard). In our
algorithm, we have more complex message M, than what is used in RSA algorithm. Therefore, it
is very difficult to find any of the prime numbers P1, P2,.., Pn is NP-hard. Thus the Key K is
more secure and safe preventing it from man-in-the-middle attack and brute-force attack. To
maintain secrecy, KGC generates a new pair message and broadcast it everytime when a member
leaves the system.
7. CONCLUSION AND FUTURE ENHANCEMENT
Key transfer protocol relies on a trusted Key Generation Center (KGC) to select group key and to
distribute group keys to all group members in a secret manner. KGC assign a large prime number
to each member in the group. Our proposed algorithm is efficient both in terms of message
generation and key extraction. In future, we wish to implement our design for communication in
dynamic and hierarchical groups. Also we wish to compare our algorithm with the dual-level key
management for secure group communication.
REFERENCES
[1] Lein Harn and Changlu Lin. Authenticated Group Key Transfer Protocol Based on Secret Sharing.
IEEE Trans.Computers; Vol.59, no.6, 2010, pp.842-846.
[2] W. Diffie and M.E. Hellman. New Directions in Cryptography. IEEE Trans. Information Theory;
Vol. IT-22, No. 6, 1976, pp.644-654.
[3] Mike Burmester and Yvo Desmedt. A Secure and Scalable Group Key Exchange System,”
Information Processing Letters; 94(3), 2005, pp. 137—143.
[4] Bohli. A Framework for Robust Group Key Agreement. In Computational Science and Its
applications - ICCSA 2006 (3), Lecture Notes in Computer Science; vol. 3982, Springer 2006, pp.
355-364.
[5] J. Katz and M. Yung. Scalable Protocols for Authenticated Group Key Exchange. J Cryptology; Vol.
20, 2007, pp. 85-113.
[6] M. Eltoweissy, M.H. Heydari, L. Morales, and I.H. Sudborough, “Combinatorial Optimization of
Group Key Management,” J. Network and Systems Management, Vol. 12, No. 1, pp. 33-50, 2004.
[7] Chia-Yin Lee, Zhi-Hui Wang, Lein Harn, Chin-Chen Chang. Secure Key Transfer Protocol Based on
Secret Sharing for Group Communications. IEICE Transactions; 94-D(11), 2011,pp. 2069-2076.
[8] E. Bresson, O. Chevassut, and D. Pointcheval. Provably-Secure Authenticated Group Diffie-Hellman
Key Exchange. ACM Trans. Information and System Security; Vol. 10, No. 3, Aug 2007, pp. 255-
264.
[9] Tzeng. A Secure Fault-Tolerant Conference-Key Agreement Protocol. IEEE Trans. Computers;
51(4), 2002, pp 373-379.
[10] H. Harney, C. Muckenhirn, and T. Rivers. Group Key Management Protocol (GKMP)
Architecture; RFC 2094, July 1997.
[11 .M. Burmester and Y.G. Desmedt. A Secure and Efficient Conference Key Distribution System. Proc.
Eurocrypt ’94 Workshop Advances in Cryptology;1995, pp. 275-286.
8. 182 Computer Science & Information Technology (CS & IT)
[12. M. Steiner, G. Tsudik, and M. Waidner. Diffie-Hellman Key Distribution Extended to Group
Communication. Proc. Third ACM Conf. Computer and Comm. Security (CCS ’96), 1996, pp. 31-37.
[13. E. Bresson, O. Chevassut, D. Pointcheval, and J.-J. Quisquater. Provably Authenticated Group Diffie-
Hellman Key Exchange. Proc. ACM Conf. Computer and Comm. Security (CCS ’01), 2000, pp. 255-
264.