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

[[alternative]]A Diffie-Hellman Quantum Session Key Establishment Protocol without Entanglement

小女孩, HSIANG CHANG

Published Jan 1, 2019• 0 citations
OpenAlex

Abstract

[[abstract]] 在2016到2017年間Shi等人發表了三篇量子可否認簽章,其中一篇為在對方公鑰上使用量子邏輯門運算,其餘兩篇則是雙方利用己方私鑰旋轉對方公鑰的方式獲得通訊金鑰。然而,在前者的研究中,在金鑰產生後該通訊金鑰在通訊的過程中皆無改變。但是,從資訊安全的角度來說,該通訊金鑰應在每次使用後改變。因此,難以說明上述三篇通訊金鑰建立方式有符合資訊安全要求。基此,本文透過迪菲-赫爾曼金鑰交換協議,產生每次使用過後皆能改變通訊金鑰的協議。並且在我們分析過後,確認本次提出的協議是安全的,可以抵擋多種惡意的攻擊方式。

Related papers

A Diffie-Hellman quantum session key establishment protocol without entanglement.

Yalin Chen, Chang Hsiang, Liangchun Wang +2 more

•Jan 1, 2019•1 citation

A Quantum Diffie-Hellman Protocol

Pranav Subramaniam, Abhishek Parakh

In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations.

IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)•Oct 1, 2014•5 citations

A Performance Evaluation of Post-Quantum Cryptography in the Signal Protocol

Markus Alvila

The Signal protocol can be considered state-of-the-art when it comes to secure messaging, but advances in quantum computing stress the importance of finding post-quantum resistant alternatives to its asymmetric cryptographic primitives. The aim is to determine whether existing post-quantum cryptography can be used as a drop-in replacement for the public-key cryptography currently used in the Signal protocol and what the performance trade-offs may be. An implementation of the Signal protocol using commutative supersingular isogeny Diffie-Hellman (CSIDH) key exchange operations in place of elliptic-curve Diffie-Hellman (ECDH) is proposed. The benchmark results on a Samsung Galaxy Note 8 mobile device equipped with a 64-bit Samsung Exynos 9 (8895) octa-core CPU shows that it takes roughly 8 seconds to initialize a session using CSIDH-512 and over 40 seconds using CSIDH-1024, without platform specific optimization. To the best of our knowledge, the proposed implementation is the first post-quantum resistant Signal protocol implementation and the first evaluation of using CSIDH as a drop-in replacement for ECDH in a communication protocol.

•Jan 1, 2019•0 citations

Quantum Diffie-Hellman Key Exchange.

Dirk Fischer

•Jan 1, 2021•1 citation

Quantum Cryptography Without Entanglement

Minki Hhan, Tomoyuki Morimae, Keita Xagawa

Lecture notes in computer science•Nov 6, 2026•1 citation

Signed (Group) Diffie–Hellman Key Exchange with Tight Security

Jiaxin Pan, Chen Qian, Magnus Ringerud

Abstract We propose the first tight security proof for the ordinary two-message signed Diffie–Hellman key exchange protocol in the random oracle model. Our proof is based on the strong computational Diffie–Hellman assumption and the multiuser security of a digital signature scheme. With our security proof, the signed DH protocol can be deployed with optimal parameters, independent of the number of users or sessions, without the need to compensate any security loss. We abstract our approach with a new notion called verifiable key exchange. In contrast to a known tight three-message variant of the signed Diffie–Hellman protocol (Gjøsteen and Jager, in: Shacham, Boldyreva (eds) CRYPTO 2018, Part II. LNCS, Springer, Heidelberg, 2018), we do not require any modification to the original protocol, and our tightness result is proven in the “Single-Bit-Guess” model which we know can be tightly composed with symmetric cryptographic primitives to establish a secure channel. Finally, we extend our approach to the group setting and construct the first tightly secure group authenticated key exchange protocol.

Journal of Cryptology•Sep 27, 2022•28 citations
[[abstract]] 在2016到2017年間Shi等人發表了三篇量子可否認簽章,其中一篇為在對方公鑰上使用量子邏輯門運算,其餘兩篇則是雙方利用己方私鑰旋轉對方公鑰的方式獲得通訊金鑰。然而,在前者的研究中,在金鑰產生後該通訊金鑰在通訊的過程中皆無改變。但是,從資訊安全的角度來說,該通訊金鑰應在每次使用後改變。因此,難以說明上述三篇通訊金鑰建立方式有符合資訊安全要求。基此,本文透過迪菲-赫爾曼金鑰交換協議,產生每次使用過後皆能改變通訊金鑰的協議。並且在我們分析過後,確認本次提出的協議是安全的,可以抵擋多種惡意的攻擊方式。
The Signal protocol can be considered state-of-the-art when it comes to secure messaging, but advances in quantum computing stress the importance of finding post-quantum resistant alternatives to its asymmetric cryptographic primitives. The aim is to determine whether existing post-quantum cryptography can be used as a drop-in replacement for the public-key cryptography currently used in the Signal protocol and what the performance trade-offs may be. An implementation of the Signal protocol using commutative supersingular isogeny Diffie-Hellman (CSIDH) key exchange operations in place of elliptic-curve Diffie-Hellman (ECDH) is proposed. The benchmark results on a Samsung Galaxy Note 8 mobile device equipped with a 64-bit Samsung Exynos 9 (8895) octa-core CPU shows that it takes roughly 8 seconds to initialize a session using CSIDH-512 and over 40 seconds using CSIDH-1024, without platform specific optimization. To the best of our knowledge, the proposed implementation is the first post-quantum resistant Signal protocol implementation and the first evaluation of using CSIDH as a drop-in replacement for ECDH in a communication protocol.
Abstract We propose the first tight security proof for the ordinary two-message signed Diffie–Hellman key exchange protocol in the random oracle model. Our proof is based on the strong computational Diffie–Hellman assumption and the multiuser security of a digital signature scheme. With our security proof, the signed DH protocol can be deployed with optimal parameters, independent of the number of users or sessions, without the need to compensate any security loss. We abstract our approach with a new notion called verifiable key exchange. In contrast to a known tight three-message variant of the signed Diffie–Hellman protocol (Gjøsteen and Jager, in: Shacham, Boldyreva (eds) CRYPTO 2018, Part II. LNCS, Springer, Heidelberg, 2018), we do not require any modification to the original protocol, and our tightness result is proven in the “Single-Bit-Guess” model which we know can be tightly composed with symmetric cryptographic primitives to establish a secure channel. Finally, we extend our approach to the group setting and construct the first tightly secure group authenticated key exchange protocol.