Abstract—Due to the growing importance in the fields of computer networks, how to keep user’s privacy has drawn more and more concerns in recent years. In this paper, based on a ring signature scheme, we propose a new secure anonymous authenticated key exchange protocol, which inherits all the good virtues of the previous protocols. Furthermore, we discuss the security attributes of our new scheme. Finally, we give an extension of our new scheme’s application and make a conclusion of this paper. Index Terms—ring signature, anonymous authentication, key exchange I.
Abstract—Due to the growing importance in the fields of computer networks, how to keep user’s privacy has drawn more and more concerns in recent years. In this paper, based on a ring signature scheme, we propose a new secure anonymous authenticated key exchange protocol, which inherits all the good virtues of the previous protocols. Furthermore, we discuss the security attributes of our new scheme. Finally, we give an extension of our new scheme’s application and make a conclusion of this paper. Index Terms—ring signature, anonymous authentication, key exchange I.
Authenticated key exchange (AKE) is a crucial cryptographic primitive used for establishing an authenticated and confidential communication channel between parties, which has been widely used in our daily life when we surf on the Internet. However, in past decades mutual AKE protocols have been studied extensively in theory, while in many practical environments such as in the Tor anonymity network the mutual authentication property is undesirable. Meanwhile, considering privacy protection is getting more and more attention and one-way AKE protocols play an important role in privacy protection, so no matter in theory or in practice, it is quite meaningful to conduct research on the one-way AKE protocols. In this article, we present a new efficient anonymous one-way AKE protocol, which has strong anonymity and security properties guarantee, and efficiency advantages. Moreover, our new scheme has tight security reduction and is formally proved secure in the random oracle model under the Gap-DH and XCR signature security assumptions.
With the advancement in Internet-based technologies, network applications are no longer just limited to one-to-one communication; instead, it has become a publicly accessible resource. Regardless of this growth, such applications bring specific challenges concerning authentication, integrity, and privacy. Cryptography stands as an ideal solution to overcome these issues through an interactive method of secure communication called Key Exchange. Key exchange protocols allow two or more entities to agree upon a shared secret transmitted over a public channel without revealing any information to an eavesdropper.
This thesis contributes to the design and analysis of the variants of key exchange protocols along with their applications. As per the security requirements, the proposed schemes are either designed in an interactive model or a non-interactive model. Each scheme undergoes a series of formal and informal security analysis. The formal analysis provides simulation result using cryptographic models. Whereas, an informal analysis showcases the theoretical proves on known attacks where an adversary controls the network. The performance analysis maps the protocol’s efficiency based on the computation cost and communication size.
The first contribution introduces an interactive two-party authenticated key exchange protocol. We begin by investigating the security flaws in an existing system such as, lack of user anonymity, trace attack, clogging attack, and failure to resist replay attack. Then proposed an authenticated self-certified key exchange protocol that overcomes the addressed issues. Also, it eliminates the requirements of a trusted certificate authority to authorize the entities. The scheme achieves anonymity during session execution, mutual authentication and enables session key agreement.Based on the ideology, an application is designed, forsecure communication between ad-hoc nodes in a mobile ad-hoc network.
The second contribution contributes to the design of an Identity-based authenticated three-party key exchange protocol that overcomes the incapability of managing huge
peer-to-peer communication and high computation cost faced by two-party authenticated key exchange protocols. The proposed scheme preserves user privacy by enabling the property of anonymity and ensures non-repudiation. Based on the ideology, an application is designed to establish a secure session key between two users with the help of a trusted server for an electronic payment system.
The third contribution proposes an interactive pairing-free certificateless authenticated group key agreement scheme suitable for a resource constrained mobile network. The scheme allows any user to join or leave the group dynamically. The key agreement protocol devised in this scheme ensures un-deniability property by incorporating the signcryption, and unsigncryption algorithm.
The final contribution presents a non-interactive Identity-based deniable authentication protocol that allows an intended receiver to identify the origin of a given message without being able to prove sender’s identity to a third party.
The number of IoT devices is growing rapidly, and the interaction between devices and servers is also more frequent. However, IoT devices are often at the edge of the network, which leads their communications with the server to be completely exposed, making it more vulnerable to attacks. Moreover, IoT devices have limited energy and computational resources. Therefore, we propose in this paper a lightweight authentication and key exchange protocol with anonymity for IoT devices. The proposed scheme supports mutual authentication between IoT devices and the server. We verify the security of the protocol through formal and informal analyses. Finally, we compare security and performance with other protocols, which shows that our protocol has the advantages of being lightweight and secure.
Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.
According to the characteristics of trusted computation, we proposed an efficient pseudonym ring signature-based authentication and key agreement protocol with mutual anonymity. The use of ring signature can hide the identity information of communicating parties and effectively prevent the leakage of private information. Finally we derive a shared session key between them for their future secure communication especially in the trusted computation environment. Our protocol reaches the level of universally composable security and is more efficient.
Authenticated key agreement protocol is designed to provide pair of parties communicating over an insecure network with a secure session key.However,most of the existing authenticated key agreement protocols are not designed for protecting privacy.We emphasize user's privacy properties in network services,in particular we stress anonymity and deniability.We specify the desired security properties of privacy-enhancing authentication key agreement protocols,i.e.mutual authentication,key control,key confirmation,session-key confidentiality,known-key security,forward secrecy,anonymity of user,forward anonymity of user,unlinkability,deniability.Based on elliptic curve cryptosystem we also propose a protocol which satisfies all the desired security properties.