Measurement-device-independent quantum key distribution for nonstandalone networks

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

doi:10.1364/prj.428309

Cited by 48 publications

(9 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to the employment of a single protocol in a standalone system, the interoperability of different QKDPs in a system has attracted much attention. Roberts et al [8] and Fan-Yuan et al [9] implemented agile switching between the BB84 and MDI protocols. These efforts have confirmed the feasibility of combining multiple QKDPs to achieve high security levels, while satisfying different requirements.…”

Section: A Qkd Protocolsmentioning

confidence: 99%

“…Driven by the invention of various high-performance QKDPs, next generation quantum networks are expected to cover a whole suite of both legacy and emerging QKDPs, aiming for operation in diverse network environments and secure application scenarios. Some preliminary studies have been performed for improving the system-level interoperability between different QKDPs, such as the conversion between the BB84 and MDI protocols [8], [9]. However, the design of multi-protocol quantum networks is still in its infancy.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

From Single-Protocol to Large-Scale Multi-Protocol Quantum Networks

et al. 2022

View full text Add to dashboard Cite

In the initial stage of the quantum Internet, most of the practical quantum networks have been deployed relying on diverse individual quantum key distribution (QKD) protocols. However, this single-protocol paradigm cannot fulfill the heterogeneous requirements of the users, hence limiting the marketpenetration of quantum networks. Given the recent advances in QKD protocols, the next generation quantum networks are expected to support both legacy and emerging QKD protocols. However, the evolution from single-protocol to multi-protocol quantum networks poses numerous challenging problems. As a remedy, we conceive a practical protocol translation framework for supporting this migration from single-protocol to large-scale multi-protocol quantum networks. Furthermore, we propose a programmable multi-functional relay node architecture for harmonizing the components of a suitable relay node. A pair of protocol translation policies are conceived for meeting the challenging security requirements of migration requests, which are compared to the single-protocol-based migration solutions both in terms of the translation success probability attained (i.e., the proportion of migration requests with successful protocol translation) and the average relaying risk probability encountered (i.e., the mean of the relaying risk probabilities of endto-end key negotiation in a quantum network). Finally, we highlight a suite of open problems in both quantum secure direct communication and quantum teleportation for research into future multi-protocol quantum networks. Hefei (2016/MDI) Vienna (2008/BB84, CV, SARG04, COW, BBM92) Bristol (2019/BB84) Bristol (2020/BBM92) Cambridge (2019/BB84) Bardonecchia-Santhià (2022/TF) Cambridge-Ipswich (2019/COW) Tokyo (2010/BB84, BBM92, DPS, SARG04) Madrid (2018/CV)

show abstract

Section: A Qkd Protocolsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

From Single-Protocol to Large-Scale Multi-Protocol Quantum Networks

et al. 2022

View full text Add to dashboard Cite

show abstract

“…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

“…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%