Robust and adaptable quantum key distribution network without trusted nodes

Fan-Yuan, Guan-Jie; Lu, Feng-Yu; Wang, Shuang; Yin, Zhen-Qiang; He, De‐Yong; Chen, Wei; Zhou, Zheng; Wang, Ze-Hao; Teng, Jie; Guo, Guang‐Can; Han, Zheng‐Fu

doi:10.1364/optica.458937

Cited by 76 publications

(23 citation statements)

References 77 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…With PQC digital signature, QKD could eliminate the pre-shared secret which is always the weak point for QKD. QDS may be able to apply for short distance QKD, but for a long distance QKD such as Twin-Field QKD over 830 km by Wang et al in 2022 34 , QKD network by Fan-Yuan et al in 2021 35 and in 2022 36 , quantum safe digital signature would make the entire communication networks be quantum safe without the pre-shared secret.…”

Section: Introductionmentioning

confidence: 99%

Optimization of the multivariate polynomial public key for quantum safe digital signature

Kuang¹,

Perepechaenko²

2023

Sci Rep

View full text Add to dashboard Cite

Kuang, Perepechaenko, and Barbeau recently proposed a novel quantum-safe digital signature algorithm called Multivariate Polynomial Public Key or MPPK/DS. The key construction originated with two univariate polynomials and one base multivariate polynomial defined over a ring. The variable in the univariate polynomials represents a plain message. All but one variable in the multivariate polynomial refer to noise used to obscure private information. These polynomials are then used to produce two multivariate product polynomials, while excluding the constant term and highest order term with respect to the message variable. The excluded terms are used to create two noise functions. Then four produced polynomials, masked with two randomly chosen even numbers over the ring, form the Public Key. The two univariate polynomials and two randomly chosen numbers, behaving as an encryption key to obscure public polynomials, form the Private Key. The verification equation is derived from multiplying all of the original polynomials together. MPPK/DS uses a special safe prime to prevent private key recovery attacks over the ring, forcing adversaries to solve for private values over a sub-prime field and lift the solutions to the original ring. Lifting entire solutions from the sub-prime field to the ring is designed to be difficult based on security requirements. This paper intends to optimize MPPK/DS to reduce the signature size by a fifth. We added extra two private elements to further increase the complexity of the private key recovery attack. However, we show in our newly identified optimal attack that these extra private elements do not have any effect on the complexity of the private recovery attack due to the intrinsic feature of MPPK/DS. The optimal key-recovery attack reduces to a Modular Diophantine Equation Problem or MDEP with more than one unknown variables for a single equation. MDEP is a well-known NP-complete problem, producing a set with many equally-likely solutions, so the attacker would have to make a decision to choose the correct solution from the entire list. By purposely choosing the field size and the order of the univariate polynomials, we can achieve the desired security level. We also identified a new deterministic attack on the coefficients of two univariate private polynomials using intercepted signatures, which forms a overdetermined set of homogeneous cubic equations. To the best of our knowledge, the solution to such a problem is to brute force search all unknown variables and verify the obtained solutions. With those optimizations, MPPK/DS can offer extra security of 384 bit entropy at 128 bit field with a public key size being 256 bytes and signature size 128 or 256 bytes using SHA256 or SHA512 as the hash function respectively.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimization of the multivariate polynomial public key for quantum safe digital signature

Kuang¹,

Perepechaenko²

2023

Sci Rep

View full text Add to dashboard Cite

show abstract

“…Recently, the optimized twin-field QKD system has overcome the barriers of 140 dB channel loss and 837.8 km fibre distance has been tested [2] . Meanwhile, measurement-device-independent QKD has matured to real-world deployment over fibre network, including a network upgrade based on existing phase-encoding QKD system [3] and a robust and adaptable network [4] . Since the first protocol was proposed by Bennett and Brassard in 1984 [1] , quantum communication systems generally rely on the transmission of signals to transfer information.…”

Section: Introductionmentioning

confidence: 99%

Counterfactual quantum key distribution with untrusted detectors

Lin¹,

Wang²,

Yang³

et al. 2023

Heliyon

View full text Add to dashboard Cite

“…BB84, the first QKD protocol [10], enables two participants to establish a random secret key between each other using quantum states prepared in different bases. In [11], Fan-Yuan et al introduced a novel networking scheme for measurement-device-independent QKD. This scheme exhibits robustness against environmental disturbances and offers adaptability for multi-user access.…”

Section: Introductionmentioning

confidence: 99%

Quantum walks-based simple authenticated quantum cryptography protocols for secure wireless sensor networks

Alanezi,

Abd El-Latif,

Kolivand

et al. 2023

New J. Phys.

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) play a crucial role in various applications, ranging from environmental monitoring to industrial automation that require high levels of security. With the development of quantum technologies, many security mechanisms may be hacked due to the promising capabilities of quantum computation. To address this challenge, quantum protocols have emerged as a promising solution for enhancing the security of wireless sensor communications. One of the common types of quantum protocols is quantum key distribution (QKD) protocols, which are investigated to allow two participants with fully quantum capabilities to share a random secret key, while semi-quantum key distribution (SQKD) protocols are designed to perform the same task using fewer quantum resources to make quantum communications more realizable and practical. Quantum walk (QW) plays an essential role in quantum computing, which is a universal quantum computational paradigm. In this work, we utilize the advantages of QW to design three authenticated quantum cryptographic protocols to establish secure channels for data transmission between sensor nodes: the first one is authenticated quantum key distribution (AQKD), the second one is authenticated semi-quantum key distribution (ASQKD) with one of the two participants having limited quantum capabilities, and the last one is ASQKD but both legitimate users possess limited quantum resources. The advantages of the proposed protocols are that the partners can exchange several different keys with the same exchanged qubits, and the presented protocols depend on a one-way quantum communication channel. In contrast, all previously designed SQKD protocols rely on two-way quantum communication. Security analyses prove that the presented protocols are secure against various well-known attacks and highly efficient. The utilization of the presented protocols in wireless sensor communications opens up new avenues for secure and trustworthy data transmission, enabling the deployment of resilient WSNs in critical applications. This work also paves the way for future exploration of quantum-based security protocols and their integration into WSNs for enhanced data protection.

show abstract

Robust and adaptable quantum key distribution network without trusted nodes

Cited by 76 publications

References 77 publications

Optimization of the multivariate polynomial public key for quantum safe digital signature

Optimization of the multivariate polynomial public key for quantum safe digital signature

Counterfactual quantum key distribution with untrusted detectors

Quantum walks-based simple authenticated quantum cryptography protocols for secure wireless sensor networks

Contact Info

Product

Resources

About