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

Dianzi Ke-ji Daxue xuebao

Design and Research of CPK-Based TLS Handshake Protocol

Cheng Ke-fei

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

As one of the most widely applied transport layer security protocols,the transport layer security(TLS) protocol has caused widespread attention,but it still has a lot of problems,such as complex certificate management,too much times of interactive shake hands,safety defects,and so on.Through the analysis and research on the shake hands protocol of the TLS,and combining the features of the identity-based combined public key(CPK) cryptosystems,a new CPK-based handshake protocol is proposed.The new scheme is much better in security and reliability proved by the security analysis and the formal analysis based on the strand space theory.The simulation experiment and comparison with original protocol with equivalent security show that the CPK-based handshake protocol has some obvious advantages,such as more less number of shake hands interaction,more simple identification,and the higher security and reliability.

Related papers

An efficient two-party key exchange protocol with strong security

Shao-feng DENG, LI Yi-fa, Yiqun Deng

Combined public key (CPK) cryptography does not need certificates to guarantee the authenticity of public keys and avoids the inherent key escrow problem of identity-based cryptography. Based on the efficient CPK scheme, we present an efficient three-round two-party authenticated key exchange protocol with strong security, which is provably secure in the standard model under the decisional Diffie-Hellman (DDH) assumption. The protocol can keep the session key secret from the adversary except that one party’s ephemeral private key and static private key are all revealed to the adversary. Compared to the existing protocols, this protocol not only assures strong security but also is more efficient.

Wuhan University Journal of Natural Sciences•May 12, 2010•2 citations

Improving TLS Security By Quantum Cryptography

Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Azizi

Quantum Cryptography or Quantum Key Distribution (QKD) solves the key distribution problem by allowing the exchange of a cryptographic key between two remote parties with absolute security, guaranteed by the laws of quantum physics.Extensive studies have been undertaken on QKD since it was noted that quantum computers could break public key cryptosystems based on number theory.Actually, the progress of research in this field allows the implementation of QKD outside of laboratories.Efforts are made to exploit this technology in the existing communication networks and to improve the performance and reliability of the implemented technologies.Some research is in progress for the integration of QKD with the protocols in different layers of OSI model.The examples of such research effort are the integration of QKD in point-to-point protocol (PPP) OSI layer 2 and the integration of QKD with IPSEC at OSI layer-3.All these works are moving towards the utilization of QKD technology for enhancing the security of modern computing applications on the internet.In this paper, we present a novel extension of the TLS protocol based on QKD.We introduce a scheme for integrating Quantum Cryptography in this protocol.Our approach improves the security of the process of authentication and data encryption.Also, we describe an example to illustrate the feasibility of our scheme's implementation.

International Journal of Network Security & Its Applications•Jul 9, 2010•7 citations

Certificateless Key Agreement Protocol

Yixiang Chen

Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. A new two party certificateless key agreement protocol (CL-KA) is proposed and we proved it secure in the random oracle model (ROM). Our protocol only requires each entity to compute one pairing, up to now, it turns out to be the most efficient one of all the previously known CL-KA schemes.

International Conference on E-Business and Information System Security (EBISS)•May 1, 2010•1 citation

Cryptanalysis of Three Certificate-Based Authenticated Key Agreement Protocols and a Secure Construction.

Yang Lu, Quanling Zhang, Jiguo Li

Certificate-based cryptography is a new public-key cryptographic paradigm that has very appealing features, namely it simplifies the certificate management problem in traditional public key cryptography while eliminating the key escrow problem in identity-based cryptography. So far, three authenticated key agreement (AKA) protocols in the setting of certificate-based cryptography have been proposed in the literature. Unfortunately, none of them are secure under the public key replacement (PKR) attack. In this paper, we first present a security model for certificate-based AKA protocols that covers the PKR attacks. We then explore the existing three certificate-based AKA protocols and show the concrete attacks against them respectively. To overcome the weaknesses in these protocols, we propose a new certificate-based AKA protocol and prove its security strictly in the random oracle model. Performance comparison shows that the proposed protocol outperforms all the previous certificate-based AKA protocols.

•Jan 1, 2015•0 citations

Certificateless Two Party Key Agreement Protocol

Wenhao Liu, Chunxiang Xu, Jian Feng Xu

Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. The provably secure certificateless key agreement protocol is proposed by Lippold et al. in 2009, but their protocol suffers from computation burden. Owing to the above-mentioned situations, a new certificateless two party key agreement protocol (CL-KA) is proposed and the security attributes are analyzed in the extended Canetti-Krawzcyk(eCK) security model. Our protocol only requires each entity to compute two pairings, up to now, it turns out to be the most efficient one of all the previously known security CL-KA schemes.

International Conference on Multimedia Information Networking and Security•Jan 1, 2010•3 citations

Integrating Entanglement Swapping into Secure Socket Layer — Handshake Protocol

Gabriela Mogos

The protocol Secure Sockets Layer uses a combination of symmetrical and symmetrical encryptions. As we know, encryption with symmetrical keys is more rapid than the one with public keys, the latter offering, however, a much better method of authentication. The protocol Secure Sockets Layer-handshake allows the authentication client-server and the cooperation between parties for the creation of symmetrical keys used for encryption and decryption.

ASME Press eBooks•Jan 1, 2011•0 citations
As one of the most widely applied transport layer security protocols,the transport layer security(TLS) protocol has caused widespread attention,but it still has a lot of problems,such as complex certificate management,too much times of interactive shake hands,safety defects,and so on.Through the analysis and research on the shake hands protocol of the TLS,and combining the features of the identity-based combined public key(CPK) cryptosystems,a new CPK-based handshake protocol is proposed.The new scheme is much better in security and reliability proved by the security analysis and the formal analysis based on the strand space theory.The simulation experiment and comparison with original protocol with equivalent security show that the CPK-based handshake protocol has some obvious advantages,such as more less number of shake hands interaction,more simple identification,and the higher security and reliability.
Combined public key (CPK) cryptography does not need certificates to guarantee the authenticity of public keys and avoids the inherent key escrow problem of identity-based cryptography. Based on the efficient CPK scheme, we present an efficient three-round two-party authenticated key exchange protocol with strong security, which is provably secure in the standard model under the decisional Diffie-Hellman (DDH) assumption. The protocol can keep the session key secret from the adversary except that one party’s ephemeral private key and static private key are all revealed to the adversary. Compared to the existing protocols, this protocol not only assures strong security but also is more efficient.
Quantum Cryptography or Quantum Key Distribution (QKD) solves the key distribution problem by allowing the exchange of a cryptographic key between two remote parties with absolute security, guaranteed by the laws of quantum physics.Extensive studies have been undertaken on QKD since it was noted that quantum computers could break public key cryptosystems based on number theory.Actually, the progress of research in this field allows the implementation of QKD outside of laboratories.Efforts are made to exploit this technology in the existing communication networks and to improve the performance and reliability of the implemented technologies.Some research is in progress for the integration of QKD with the protocols in different layers of OSI model.The examples of such research effort are the integration of QKD in point-to-point protocol (PPP) OSI layer 2 and the integration of QKD with IPSEC at OSI layer-3.All these works are moving towards the utilization of QKD technology for enhancing the security of modern computing applications on the internet.In this paper, we present a novel extension of the TLS protocol based on QKD.We introduce a scheme for integrating Quantum Cryptography in this protocol.Our approach improves the security of the process of authentication and data encryption.Also, we describe an example to illustrate the feasibility of our scheme's implementation.
Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. A new two party certificateless key agreement protocol (CL-KA) is proposed and we proved it secure in the random oracle model (ROM). Our protocol only requires each entity to compute one pairing, up to now, it turns out to be the most efficient one of all the previously known CL-KA schemes.
Certificate-based cryptography is a new public-key cryptographic paradigm that has very appealing features, namely it simplifies the certificate management problem in traditional public key cryptography while eliminating the key escrow problem in identity-based cryptography. So far, three authenticated key agreement (AKA) protocols in the setting of certificate-based cryptography have been proposed in the literature. Unfortunately, none of them are secure under the public key replacement (PKR) attack. In this paper, we first present a security model for certificate-based AKA protocols that covers the PKR attacks. We then explore the existing three certificate-based AKA protocols and show the concrete attacks against them respectively. To overcome the weaknesses in these protocols, we propose a new certificate-based AKA protocol and prove its security strictly in the random oracle model. Performance comparison shows that the proposed protocol outperforms all the previous certificate-based AKA protocols.
Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. The provably secure certificateless key agreement protocol is proposed by Lippold et al. in 2009, but their protocol suffers from computation burden. Owing to the above-mentioned situations, a new certificateless two party key agreement protocol (CL-KA) is proposed and the security attributes are analyzed in the extended Canetti-Krawzcyk(eCK) security model. Our protocol only requires each entity to compute two pairings, up to now, it turns out to be the most efficient one of all the previously known security CL-KA schemes.