© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

IEEE Access

Key Escrow Protocol Based on a Tripartite Authenticated Key Agreement and Threshold Cryptography

Zhen Wang, Zhaofeng Ma, Shoushan Luo, Hongmin Gao

Published Jan 1, 2019• 11 citations

Abstract

While instant messaging systems bring convenience to people's lives and work, they also make it easier for malicious users to discuss and plot illegal activities. Therefore, determining how to balance the privacy protection requirements of user communication in the network with the authorized monitoring requirements of law enforcement agencies (LEAs) is a meaningful task. To solve this problem, a new tripartite authenticated key agreement (Tri-AKA) protocol and a session key escrow scheme based on threshold cryptography and the new Tri-AKA protocol were proposed. In the proposed scheme, the LEA participates as a normal user in the key agreement process of two users and uses (t, n) threshold cryptography to share its ephemeral private key with n key escrow agents (KEAs). When necessary, the LEA can combine t KEAs to recover the specified session key and decrypt the communications, thereby preventing malicious administrators in the LEA from arbitrarily monitoring user communications. Finally, we proved the security of the proposed Tri-AKA protocol under the Computational Diffie-Hellman (CDH) assumption with the Random Oracle Model and the security of the proposed key escrow scheme under the Elliptic Curve Discrete Logarithm (ECDL) assumption. Analysis of our session key escrow scheme and comparison with other schemes show that our scheme can avoid the “once monitor, monitor forever” scenario and achieve fine-grained control in each session. Moreover, our scheme has low storage overhead for each KEA.

DOI: 10.1109/access.2019.2946874

Related papers

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•2 citations

An Efficient Certificate-Based Authenticated Key Agreement Protocol without Bilinear Pairing

Yang Lu, Quanling Zhang, Jiguo Li +1 more

An authenticated key agreement (AKA) protocol is extremely essential to secure communications over insecure public networks. It enables the communication parties to securely set up a shared session key in present of the malicious attackers. Certificate-based cryptography (CBC) is a novel public-key cryptographic primitive that has many attractive merits. It solves the certificate revocation problem in conventional public-key cryptography and the key-escrow problem in identity-based cryptography. Till now, four AKA protocols have been proposed in the setting of CBC. However, all of them adopt the costly bilinear pairings and are not suitable for the devices which have limited computing resources and battery power. So, it is interesting and worthwhile to design a certificate-based AKA protocol without using the bilinear pairings. In this paper, we develop a pairing-free certificate-based AKA protocol. The proposed protocol is proven secure under the classic computational Diffie-Hellman assumption in the random oracle model. Compared with the previous pairing-based certificate-based AKA protocols, the proposed protocol enjoys obvious advantage in the computation efficiency.DOI: http://dx.doi.org/10.5755/j01.itc.46.3.14968

Information Technology And Control•Sep 7, 2017•2 citations

Lightweight Certificateless Authenticated Key Agreement Protocol

Gervais Mwitende

Data security and privacy are important to prevent the reveal, modification and unauthorized usage of sensitive information. The introduction of using critical power devices for internet of things (IoTs), e-commerce, e-payment, and wireless sensor networks (WSNs) has brought a new challenge of security due to the low computation capability of sensors. Therefore, the lightweight authenticated key agreement protocols are important to protect their security and privacy. Several researches have been published about authenticated key agreement. However, there is a need of lightweight schemes that can fit with critical capability devices. Addition to that, a malicious key generation center (KGC) can become a threat to watch other users, i.e impersonate user by causing the key escrow problem. Therefore, we propose a lightweight certificateless Authenticated Key Agreement (AKA) based on the computation Diffie-Hellman problem (CDHP). The proposed protocol maintains the characteristics of certificateless public key cryptography. The protocol is split into two combined phases. In the first phase, our protocol establishes a session key between users (sender and receiver). In the second phase, we use a lightweight proxy blind signature based on elliptic curve discrete logarithm problem (ECDLP). The used proxy signature has small computation costs, and can fit for small devices such sensors and protects against un-authentication and un-authorization on decentralized system. Compared to the existing AKA schemes, our scheme has small computation costs. The protocol achieves the well known security features compared to the related protocols.

•Oct 28, 2023•0 citations

Extended identity-based authenticated key agreement in standard model

Min Chen

The existing identity-based authenticated key agreement(ID-AKA) protocols in standard model either had known security flaws or could be verified security in weak security models.This paper proposed an extended ID-AKA protocol,which fully considered the security needs for leaking the long-term private keys,the session temporary secrets and the PKG master key.It further defined two types of fresh oracle and a session-state query,based on the ID-BJM security model,in which simulated secure games of key-compromise impersonation and perfect forward secrecy respectively.The new protocol was proven to meet the strong security with the improved ID-BJM model.The comparative analysis shows that the new protocol not only has high security,but lower computational costs.And the extended ID-AKA protocol can be used to build secure point to point communication channel on the application scenarios without key escrow.

Jisuanji yingyong yanjiu•Jan 1, 2014•0 citations

Efficient and Secure Design of ID-3PAKA Protocol Using ECC

Daya Sagar Gupta, Krittibas Parai, Mohammad S. Obaidat +1 more

In this modern era, the need for key agreement protocols equipped with high-speed Internet has become necessary in information/network security. An authenticated key agreement (AKA) protocol is a technique that negotiates a secret session key among various users in a network and is used in many scenarios like mutual authentication, data integrity, and many more. The current state-of-the-art include many AKA protocols that are either vulnerable to different attacks or incur massive communication and computational costs. This paper proposes an identity-based three-party authenticated key agreement (ID-3PAKA) protocol using elliptic curve cryptography (ECC). The proposed ID-3PAKA protocol generates a shared secret session key among three users. The security of the proposed ID-3PAKA protocol relies on the hardness assumption of the ECDLP and the CDH problems. The proposed ID-3PAKA protocol is safe against active and passive attacks, which is proved through the simulation of the OFMC and Cl-AtS back-ends of the AVISPA tool.

International Conference on Computer, Information and Telecommunication Systems•Nov 11, 2021•3 citations

Perfect Forward Secure Two-Party Key Agreement Protocol with Key Escrow

Mengbo Hou, Qiuliang Xu, Tao Ban

Authenticated key agreement protocol is an important primitive for establishing session key to provide secure communications in open and distributed environment. Key escrow is essential in situations where confidentiality and audit trail are legal requirements, whilst perfect forward secrecy is desirable to provide stronger security. i.e. the adversary couldn't acquire the past session keys even the long term key of user was compromised. In this paper, we present a secure two-party identity-based authenticated key agreement protocol, which was inspired on a new identity-based encryption scheme first proposed by Gentry (Eurocrypt'06). The new protocol achieves most of the required security attributes and can be used properly in the escrow mode. We show that the scheme achieves the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the perfect forward secrecy attribute.

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)•Sep 1, 2009•0 citations

While instant messaging systems bring convenience to people's lives and work, they also make it easier for malicious users to discuss and plot illegal activities. Therefore, determining how to balance the privacy protection requirements of user communication in the network with the authorized monitoring requirements of law enforcement agencies (LEAs) is a meaningful task. To solve this problem, a new tripartite authenticated key agreement (Tri-AKA) protocol and a session key escrow scheme based on threshold cryptography and the new Tri-AKA protocol were proposed. In the proposed scheme, the LEA participates as a normal user in the key agreement process of two users and uses (t, n) threshold cryptography to share its ephemeral private key with n key escrow agents (KEAs). When necessary, the LEA can combine t KEAs to recover the specified session key and decrypt the communications, thereby preventing malicious administrators in the LEA from arbitrarily monitoring user communications. Finally, we proved the security of the proposed Tri-AKA protocol under the Computational Diffie-Hellman (CDH) assumption with the Random Oracle Model and the security of the proposed key escrow scheme under the Elliptic Curve Discrete Logarithm (ECDL) assumption. Analysis of our session key escrow scheme and comparison with other schemes show that our scheme can avoid the “once monitor, monitor forever” scenario and achieve fine-grained control in each session. Moreover, our scheme has low storage overhead for each KEA.

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

An authenticated key agreement (AKA) protocol is extremely essential to secure communications over insecure public networks. It enables the communication parties to securely set up a shared session key in present of the malicious attackers. Certificate-based cryptography (CBC) is a novel public-key cryptographic primitive that has many attractive merits. It solves the certificate revocation problem in conventional public-key cryptography and the key-escrow problem in identity-based cryptography. Till now, four AKA protocols have been proposed in the setting of CBC. However, all of them adopt the costly bilinear pairings and are not suitable for the devices which have limited computing resources and battery power. So, it is interesting and worthwhile to design a certificate-based AKA protocol without using the bilinear pairings. In this paper, we develop a pairing-free certificate-based AKA protocol. The proposed protocol is proven secure under the classic computational Diffie-Hellman assumption in the random oracle model. Compared with the previous pairing-based certificate-based AKA protocols, the proposed protocol enjoys obvious advantage in the computation efficiency.DOI: http://dx.doi.org/10.5755/j01.itc.46.3.14968

Data security and privacy are important to prevent the reveal, modification and unauthorized usage of sensitive information. The introduction of using critical power devices for internet of things (IoTs), e-commerce, e-payment, and wireless sensor networks (WSNs) has brought a new challenge of security due to the low computation capability of sensors. Therefore, the lightweight authenticated key agreement protocols are important to protect their security and privacy. Several researches have been published about authenticated key agreement. However, there is a need of lightweight schemes that can fit with critical capability devices. Addition to that, a malicious key generation center (KGC) can become a threat to watch other users, i.e impersonate user by causing the key escrow problem. Therefore, we propose a lightweight certificateless Authenticated Key Agreement (AKA) based on the computation Diffie-Hellman problem (CDHP). The proposed protocol maintains the characteristics of certificateless public key cryptography. The protocol is split into two combined phases. In the first phase, our protocol establishes a session key between users (sender and receiver). In the second phase, we use a lightweight proxy blind signature based on elliptic curve discrete logarithm problem (ECDLP). The used proxy signature has small computation costs, and can fit for small devices such sensors and protects against un-authentication and un-authorization on decentralized system. Compared to the existing AKA schemes, our scheme has small computation costs. The protocol achieves the well known security features compared to the related protocols.

The existing identity-based authenticated key agreement(ID-AKA) protocols in standard model either had known security flaws or could be verified security in weak security models.This paper proposed an extended ID-AKA protocol,which fully considered the security needs for leaking the long-term private keys,the session temporary secrets and the PKG master key.It further defined two types of fresh oracle and a session-state query,based on the ID-BJM security model,in which simulated secure games of key-compromise impersonation and perfect forward secrecy respectively.The new protocol was proven to meet the strong security with the improved ID-BJM model.The comparative analysis shows that the new protocol not only has high security,but lower computational costs.And the extended ID-AKA protocol can be used to build secure point to point communication channel on the application scenarios without key escrow.

In this modern era, the need for key agreement protocols equipped with high-speed Internet has become necessary in information/network security. An authenticated key agreement (AKA) protocol is a technique that negotiates a secret session key among various users in a network and is used in many scenarios like mutual authentication, data integrity, and many more. The current state-of-the-art include many AKA protocols that are either vulnerable to different attacks or incur massive communication and computational costs. This paper proposes an identity-based three-party authenticated key agreement (ID-3PAKA) protocol using elliptic curve cryptography (ECC). The proposed ID-3PAKA protocol generates a shared secret session key among three users. The security of the proposed ID-3PAKA protocol relies on the hardness assumption of the ECDLP and the CDH problems. The proposed ID-3PAKA protocol is safe against active and passive attacks, which is proved through the simulation of the OFMC and Cl-AtS back-ends of the AVISPA tool.

Authenticated key agreement protocol is an important primitive for establishing session key to provide secure communications in open and distributed environment. Key escrow is essential in situations where confidentiality and audit trail are legal requirements, whilst perfect forward secrecy is desirable to provide stronger security. i.e. the adversary couldn't acquire the past session keys even the long term key of user was compromised. In this paper, we present a secure two-party identity-based authenticated key agreement protocol, which was inspired on a new identity-based encryption scheme first proposed by Gentry (Eurocrypt'06). The new protocol achieves most of the required security attributes and can be used properly in the escrow mode. We show that the scheme achieves the attributes of known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. In addition, it captures the perfect forward secrecy attribute.