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

Wireless Personal Communications

A Non-Time-Limited Channel Sounding Protocol for Key Generation

Jingmei Liu, Shen Zhiwei, Ren Zhuangzhuang, Liu Jingwei, Gong Fengkui

Published May 18, 2021• 1 citation
Publisher
DOI
10.1007/s11277-021-08490-4

Related papers

Cooperative secret key generation based on phase estimation for narrowband fading channels

Liu Hu

By exploiting the randomness of wireless channel, secret keys between two terminals can be generated through certain key generation agreement in the physical layer(PHY). However, due to the shorter correlation time of the channel and the Doppler Effect caused by the users' mobility, traditional key generation rate is limited. In this paper, we propose a new physical layer cooperative key generation protocol. Theoretical analysis is also given through both information theory and signal statistical analysis. The simulation results show that compared with non-cooperative key generation protocol, the new protocol greatly improves the key generation rate due to the relay node.

Journal of Jiangxi University of Science and Technology•Jan 1, 2014•0 citations

A Highly Consistent and High-speed Physical Layer Key Generation Scheme

Jiayu Zhao, Jingmei Liu, Ruibin Dai

Wireless Personal Communications•Nov 1, 2023•1 citation

Decoy State based Time Synchronization

Lukas Tiefenthaler, Hannah Thiel, Davide Rusca +1 more

Time synchronization is a crucial requirement in quantum key distribution (QKD)8 protocols, ensuring accurate key generation via the correct assignment of bits of raw key and9 enabling eavesdropping detection via the precise recording of photon statistics. State-of-the-art10 experiments typically use an extra channel to synchronize the clocks of the transmitter and receiver11 via classical signals. In this work, we study the possibility of performing clock synchronization12 via the signals used for the key generation, which are already present in decoy-state-based BB8413 protocols.14 Without altering the protocol in any way, we use the different mean photon numbers of the15 signal and decoy states for time synchronization without a dedicated physical channel capable of16 clock synchronization. The proposed method relies only on the photons sent and received for17 key generation and does not require any change to the QKD protocol. The only change in the18 experiment is on the software level, thus making it very simple to implement.19 We demonstrate clock synchronization method in a simulation of a specific fiber-based QKD20 experiment. Like other decoy-state-based BB84 protocols, it is based on weak coherent pulses.21 In this simulation, we investigate the parameter space to find limits and optimal choices of our22 proposed method.23 In addition to the non-protocol-altering clock synchronization method, we also discuss an24 approach that significantly improves performance in lossy channels by introducing an additional25 decoy state with a very high mean photon number.26 By eliminating the need for an extra channel capable of clock synchronization, both methods27 proposed potentially reduce the complexity and cost of QKD systems and improve their agility

quant-pharXiv:2605.20857•Optics Express•May 21, 2026•0 citations

Key Distribution Protocol Based on Noisy Channel and Error Detecting Codes

Lecture notes in computer science•Jan 1, 2001•2 citations

An Optimized, Authenticated Key Distribution Protocol for Optical Channels

Sara Abozied, Hassan M. A. Elkamchouchi, Yasmine Abouelseoud +1 more

Lecture notes in electrical engineering•Sep 11, 2013•0 citations

Trusted center verification model and classical channel remote state preparation

Tomoyuki Morimae, Yuki Takeuchi

The classical channel remote state preparation (ccRSP) is an important two-party primitive in quantum cryptography. Alice (classical polynomial-time) and Bob (quantum polynomial-time) exchange polynomial rounds of classical messages, and Bob finally gets random single-qubit states while Alice finally gets classical descriptions of the states. In [T. Morimae, arXiv:2003.10712], an information-theoretically-sound non-interactive protocol for the verification of quantum computing was proposed. The verifier of the protocol is classical, but the trusted center is assumed that sends random single-qubit states to the prover and their classical descriptions to the verifier. If the trusted center can be replaced with a ccRSP protocol while keeping the information-theoretical soundness, an information-theoretically-sound classical verification of quantum computing is possible, which solves the long-standing open problem. In this paper, we show that it is not the case unless BQP is contained in MA. We also consider a general verification protocol where the verifier or the trusted center first sends quantum states to the prover, and then the prover and the verifier exchange a constant round of classical messages. We show that the first quantum message transmission cannot be replaced with an (even approximate) ccRSP protocol while keeping the information-theoretical soundness unless BQP is contained in AM. We finally study the verification with the computational soundness. We show that if a ccRSP protocol satisfies a certain condition even against any quantum polynomial-time malicious prover, the replacement of the trusted center with the ccRSP protocol realizes a computationally-sound classical verification of quantum computing. The condition is weaker than the verifiability of the ccRSP.

arXiv:2008.05033•Aug 11, 2020•2 citations
By exploiting the randomness of wireless channel, secret keys between two terminals can be generated through certain key generation agreement in the physical layer(PHY). However, due to the shorter correlation time of the channel and the Doppler Effect caused by the users' mobility, traditional key generation rate is limited. In this paper, we propose a new physical layer cooperative key generation protocol. Theoretical analysis is also given through both information theory and signal statistical analysis. The simulation results show that compared with non-cooperative key generation protocol, the new protocol greatly improves the key generation rate due to the relay node.
Time synchronization is a crucial requirement in quantum key distribution (QKD)8 protocols, ensuring accurate key generation via the correct assignment of bits of raw key and9 enabling eavesdropping detection via the precise recording of photon statistics. State-of-the-art10 experiments typically use an extra channel to synchronize the clocks of the transmitter and receiver11 via classical signals. In this work, we study the possibility of performing clock synchronization12 via the signals used for the key generation, which are already present in decoy-state-based BB8413 protocols.14 Without altering the protocol in any way, we use the different mean photon numbers of the15 signal and decoy states for time synchronization without a dedicated physical channel capable of16 clock synchronization. The proposed method relies only on the photons sent and received for17 key generation and does not require any change to the QKD protocol. The only change in the18 experiment is on the software level, thus making it very simple to implement.19 We demonstrate clock synchronization method in a simulation of a specific fiber-based QKD20 experiment. Like other decoy-state-based BB84 protocols, it is based on weak coherent pulses.21 In this simulation, we investigate the parameter space to find limits and optimal choices of our22 proposed method.23 In addition to the non-protocol-altering clock synchronization method, we also discuss an24 approach that significantly improves performance in lossy channels by introducing an additional25 decoy state with a very high mean photon number.26 By eliminating the need for an extra channel capable of clock synchronization, both methods27 proposed potentially reduce the complexity and cost of QKD systems and improve their agility
The classical channel remote state preparation (ccRSP) is an important two-party primitive in quantum cryptography. Alice (classical polynomial-time) and Bob (quantum polynomial-time) exchange polynomial rounds of classical messages, and Bob finally gets random single-qubit states while Alice finally gets classical descriptions of the states. In [T. Morimae, arXiv:2003.10712], an information-theoretically-sound non-interactive protocol for the verification of quantum computing was proposed. The verifier of the protocol is classical, but the trusted center is assumed that sends random single-qubit states to the prover and their classical descriptions to the verifier. If the trusted center can be replaced with a ccRSP protocol while keeping the information-theoretical soundness, an information-theoretically-sound classical verification of quantum computing is possible, which solves the long-standing open problem. In this paper, we show that it is not the case unless BQP is contained in MA. We also consider a general verification protocol where the verifier or the trusted center first sends quantum states to the prover, and then the prover and the verifier exchange a constant round of classical messages. We show that the first quantum message transmission cannot be replaced with an (even approximate) ccRSP protocol while keeping the information-theoretical soundness unless BQP is contained in AM. We finally study the verification with the computational soundness. We show that if a ccRSP protocol satisfies a certain condition even against any quantum polynomial-time malicious prover, the replacement of the trusted center with the ccRSP protocol realizes a computationally-sound classical verification of quantum computing. The condition is weaker than the verifiability of the ccRSP.