KSII Transactions on Internet and Information Systems

Identity – Based Multiple Key Agreement Scheme

Massoud Hadian Dehkordi

Published Jan 1, 2011• 12 citations

Abstract

In order to protect some important information communicated through an insecure network, a common hidden key must be used.One can produce the common hidden key using key agreement protocols; and this helps to have high security in modern data networks.Today, the designers of public key cryptography protocols try to set the public identity of a system's users (like their email addresses) as their public key.This not only makes a cryptographic protocol more efficient but also decreases its cost.These protocols are called "identitybased ".In this article, an identitybased multiple key agreement scheme will be presented; this scheme uses the challengeresponse method to do the verification.While the number of random values produced in our scheme is the same as other schemes, the number of keys generated in this scheme is much more than what many other key agreement schemes produce,.Therefore, we will have less computational complexities campered with other schems.In this paper, we consider the security of our scheme and consequently,we will show that it satisfies many security conditions such as strong security.

DOI: 10.3837/tiis.2011.12.008

Related papers

An efficient identity-based key agreement protocol in a multiple PKG environment

Huan Zhou, Xiaofeng Wang, Jinshu Su

Identity-based key agreement protocol affords a natural way to combine the participant’s identity with its public key. However, most of them just consider the key agreement in a single private key generator (PKG) environment. In addition, the existing key agreement protocols have a great computing overhead for mobile computing which is more and more popular today. This paper proposes a new identity based key agreement protocol. With the help of mathematical tools, we make our protocol applied in multiple PKG environment. It also satisfies all the security properties which is set for key agreement protocol. Moreover, some of its time-consuming operations can be delivered to untrusted public computation resources, so its computing complexity can be greatly reduced.

Wuhan University Journal of Natural SciencesSep 9, 20143 citations

An enhanced certificateless authenticated key agreement protocol

Razieh Mokhtarnameh, Sin-Ban Ho, Nithiapidary Muthuvelu

Authenticated key agreement protocol is used to share a secret key for encrypting data being transferred between two or more parties over a public network. An implementation of this protocol is the certificateless key agreement which utilizes the features of the identity-based public key cryptography and the traditional public key infrastructure. This implementation can produce multiple public keys for a corresponding private key. In this paper, an alternative key generation technique is proposed for certificateless public key cryptography in order to have one public key for one private key. This will improve the security features of the relevant key generation. Furthermore, the efficiency of the proposed protocol is presented in terms of computational operation. The comparison analysis shows that the proposed protocol conveys better efficiency with all the known security attributes compared to the existing protocols.

International Conference on Advanced Communication TechnologyApr 7, 201112 citations

Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC

Mohammad Sabzinejad Farash, Mahmoud Ahmadian‐Attari

A B S T R A C T Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is generated by a trusted Private Key Generator (PKG). However, it is unrealistic to assume that a single PKG will be responsible for issuing private keys to members of dierent organizations or a large-scale nation. Hence, it is needed to consider multiple PKG environments with dierent system parameters. In this paper, we propose an identity-based key agreement protocol among users of dierent networks with independent PKGs, which makes use of elliptic curves. We prove the security of the proposed protocol in the random oracle model and show that all security attributes are satised. We also demonstrate a comparison between our protocol and some related protocols in terms of the communication costs and the execution time. The results show that the execution time of our protocol is less than 10%, and its communication costs are about 50% of the competitor protocols.

Jan 1, 201320 citations

Secure Session Framework: An Identity-based Cryptographic Key Agreement and Signature Protocol

Christian Schridde

Cryptographic protocols are used to encrypt data during their transmission over a network or to store it on a data carrier. This thesis is about the method of identity-based encryption. In this form of encryption, the name or identity of the target subject is used to encrypt the data. This property makes it a perfect tool for modern electronic communication, because all involved identities and endpoint addresses (e.g. IP addresses) have to be unique worldwide and must be known in order to establish a communication. The identity-based key agreement protocol that has been invented in this thesis has several advantages compared to existing schemes. One important property is its complete independence of key generators. This independence allows each participating security domain to set up and maintain its own key generator. They are not forced to agree on a common setup or a common secret anymore. Due to the properties of the protocol, the security domains are still compatible to each other. Users from one security domain can communicate with users from another security domain using encryption. This new property of independence is also carried over to a signature protocol. It allows users from different security domains to sign a certain object. Additionally, the act of signing is independent and the signers do not need to communicate with each other. Apart from the protocol and its security proofs with respect to standard definitions from the literature, the thesis contains an analysis of existing schemes. Attacks on known protocols and assumptions are presented, and it is shown under which circumstances these become insecure. On the one hand, a completely new approach that is based on defined or rather undefined objects in discrete structures is used. On the other hand, the method of lattice based reduction is successfully applied to the new area of secret sharing schemes. Finally, application scenarios for the protocol are presented. These scenarios are chosen such that the advantages of the protocol become apparent. Cryptographic protocols are used to encrypt data during their transmission over a network or to store it on a data carrier. This thesis is about the method of identity-based encryption. In this form of encryption, the name or identity of the target subject is used to encrypt the data. This property makes it a perfect tool for modern electronic communication, because all involved identities and endpoint addresses (e.g. IP addresses) have to be unique worldwide and must be known in order to establish a communication. The identity-based key agreement protocol that has been invented in this thesis has several advantages compared to existing schemes. One important property is its complete independence of key generators. This independence allows each participating security domain to set up and maintain its own key generator. They are not forced to agree on a common setup or a common secret anymore. Due to the properties of the protocol, the security domains are still compatible to each other. Users from one security domain can communicate with users from another security domain using encryption. This new property of independence is also carried over to a signature protocol. It allows users from different security domains to sign a certain object. Additionally, the act of signing is independent and the signers do not need to communicate with each other. Apart from the protocol and its security proofs with respect to standard definitions from the literature, the thesis contains an analysis of existing schemes. Attacks on known protocols and assumptions are presented, and it is shown under which circumstances these become insecure. On the one hand, a completely new approach that is based on defined or rather undefined objects in discrete structures is used. On the other hand, the method of lattice based reduction is successfully applied to the new area of secret sharing schemes. Finally, application scenarios for the protocol are presented. These scenarios are chosen such that the advantages of the protocol become apparent. The first application is telephony, GSM as well as Voice over IP (VoIP). In this case, the telephone number of the callee is used as the encryption key. Implementations on a modern mobile phone as well as within existing Voice over IP software are presented. The second application is IP networks. Here, the IP address of a communication unit is used as the encryption key. However, in this case, there are more problems than in the GSM/VoIP case, e.g., dynamic IP addresses or network address translation (NAT) where an IP address is substituted by another one. These are only two problems out of several for which solutions are presented.

Aug 10, 20100 citations

Robust Framework for Certificateless Authenticated Key Agreement Protocol

Smita R. Chunamari, D. G. Borse

Authenticated key agreement protocol is exploited to share a secret key for encrypting information being transferred between two or additional parties over a public network. In this implementation can produce multiple public keys for a corresponding private key. In this paper, an alternative key generation technique is proposed for certificate less public key cryptography in order to have one public key for one private key. This will improve the security features of the relevant key generation.

International Conference on Recent Trends in Information TechnologyFeb 2, 20130 citations

Cryptanalysis of an Identity-Based Multiple Key Agreement Scheme.

Qingfeng Cheng

Multiple key agreement (MKA) protocols allow two parties to generate two or more session keys in one session, which will be used for future secure communications in public network. In recent years, many MKA protocols have been proposed. However, most of them do not consider ephemeral key compromise resilience, and some of them still exists security flaws. In this paper, we analyze the scheme proposed by Dehkordi and Alimoradi in 2011, which is announced with stronger security. We will present ephemeral key compromise attack and impersonation attack against Dehkordi and Alimoradi’s protocol. For overcoming these security flaws, we also propose an improvement of Dehkordi and Alimoradi’s protocol.

Jan 1, 20121 citation