Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

Secure and Privacy-Friendly Public Key Generation and Certification

Fábio Borges, Leonardo A. Martucci, Filipe Beato, Max Mühlhäuser

Published Sep 1, 2014• 3 citations
Publisher

Abstract

Digital societies increasingly rely on secure communication between parties. Certificate enrollment protocols are used by certificate authorities to issue public key certificates to clients. Key agreement protocols, such as Diffie-Hellman, are used to compute secret keys, using public keys as input, for establishing secure communication channels. Whenever the keys are generated by clients, the bootstrap process requires either (a) an out-of-band verification for certification of keys when those are generated by the clients themselves, or (b) a trusted server to generate both the public and secret parameters. This paper presents a novel constrained key agreement protocol, built upon a constrained Diffie-Hellman, which is used to generate a secure public-private key pair, and to set up a certification environment without disclosing the private keys. In this way, the servers can guarantee that the generated key parameters are safe, and the clients do not disclose any secret information to the servers.

DOI
10.1109/trustcom.2014.19

Related papers

Modified Client-Server-Client Authenticated Key Agreement Protocols for Resource-Limited Environments

Zuowen Tan

An authenticated key agreement protocol only allows the intended parties to compute the session key. In this paper, new client-server-client authenticated key agreement protocols in the public key setting have been proposed. The new protocols are proven secure in the formal security model. Compared with the client-server-client authenticated key agreement protocols in the literature, the proposed protocols possess stronger security and higher efficiency.

網際網路技術學刊•Mar 1, 2012•0 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 Technology•Feb 2, 2013•0 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

Secure certificateless-based authenticated key agreement protocol in the client-server setting

Mengbo Hou, Qiuliang Xu

E-learning communication security should be considered to ensure sensitive message transmission. Authenticated key agreement protocol in the client- server setting is the fundamental building block for ensuring client-server entity authentication, data confidentiality and integrity. So far, great deals of two- party authenticated key agreement protocols were proposed based on traditional public key cryptography and identity-based cryptography, but the certificateless-based authenticated key agreement protocol is seldom discussed. In this paper, we propose such a secure protocol from a certificateless public key encryption scheme due to Park et al. Compared to other comparable protocols, it achieves more security attributes, such as no-key escrow, perfect forward secrecy, known session-specific temporary information security and no-key control etc. Meanwhile, it keeps nice efficiency.

International Conference on Information Technology in Medicine and Education•Aug 1, 2009•5 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, 2013•20 citations

A Secure and Efficient Key Agreement Protocol Based on Certificateless Cryptography

Nashwa A. F. Mohamed, Mohsin Hassan Abdallah Hashim, Eihab B. M. Bashier +1 more

Almostall the certificateless two-party authenticated key agreement (CTAKA) protocols found in the literature, suffer either serious security problems or inefficient performance that involves high computational costs.In this paper, we design a secure and efficient CTAKA protocol.Within the proposed CTAKA protocol, the KGC publishes the public keys of the users in a public directory (LDAP server) that has a certificate to prove its identity to the users.The LDAP certificate is the only existing certificate within the scheme.Both the two communicating parties are able to compute a common secret per session key using a secure generated random number.The protocol is fully secure against type 1 attack and fully secure against type 2 attacks under the assumptions that the KGC is an honest party and each party within the network has the full capability to keep its secret values safe.Moreover, the setup of the protocol does not include pairings and the whole key agreement process requires only four point scalar multiplications, two point additions, one hash function evaluation and one message exchange.

International Journal of Intelligent Computing Research•Dec 1, 2012•3 citations
Digital societies increasingly rely on secure communication between parties. Certificate enrollment protocols are used by certificate authorities to issue public key certificates to clients. Key agreement protocols, such as Diffie-Hellman, are used to compute secret keys, using public keys as input, for establishing secure communication channels. Whenever the keys are generated by clients, the bootstrap process requires either (a) an out-of-band verification for certification of keys when those are generated by the clients themselves, or (b) a trusted server to generate both the public and secret parameters. This paper presents a novel constrained key agreement protocol, built upon a constrained Diffie-Hellman, which is used to generate a secure public-private key pair, and to set up a certification environment without disclosing the private keys. In this way, the servers can guarantee that the generated key parameters are safe, and the clients do not disclose any secret information to the servers.
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
E-learning communication security should be considered to ensure sensitive message transmission. Authenticated key agreement protocol in the client- server setting is the fundamental building block for ensuring client-server entity authentication, data confidentiality and integrity. So far, great deals of two- party authenticated key agreement protocols were proposed based on traditional public key cryptography and identity-based cryptography, but the certificateless-based authenticated key agreement protocol is seldom discussed. In this paper, we propose such a secure protocol from a certificateless public key encryption scheme due to Park et al. Compared to other comparable protocols, it achieves more security attributes, such as no-key escrow, perfect forward secrecy, known session-specific temporary information security and no-key control etc. Meanwhile, it keeps nice efficiency.
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.
Almostall the certificateless two-party authenticated key agreement (CTAKA) protocols found in the literature, suffer either serious security problems or inefficient performance that involves high computational costs.In this paper, we design a secure and efficient CTAKA protocol.Within the proposed CTAKA protocol, the KGC publishes the public keys of the users in a public directory (LDAP server) that has a certificate to prove its identity to the users.The LDAP certificate is the only existing certificate within the scheme.Both the two communicating parties are able to compute a common secret per session key using a secure generated random number.The protocol is fully secure against type 1 attack and fully secure against type 2 attacks under the assumptions that the KGC is an honest party and each party within the network has the full capability to keep its secret values safe.Moreover, the setup of the protocol does not include pairings and the whole key agreement process requires only four point scalar multiplications, two point additions, one hash function evaluation and one message exchange.