We present quantum key distribution schemes which are autocompensating (require no alignment) and symmetric (Alice and Bob receive photons from a central source) for both polarization and time-bin qubits. The primary benefit of the symmetric configuration is that both Alice and Bob may have passive setups (neither Alice nor Bob is required to make active changes for each run of the protocol). We show that both the polarization and the time-bin schemes may be implemented with existing technology. The new schemes are related to previously described schemes by the concept of advanced waves.
Quantum cryptographic key distribution (QKD) uses extremely faint light pulses to carry quantum information between two parties (Alice and Bob), allowing them to generate a shared, secret cryptographic key. Autocompensating QKD systems automatically and passively compensate for uncontrolled time dependent variations of the optical fiber properties by coding the information as a differential phase between orthogonally-polarized components of a light pulse sent on a round trip through the fiber, reflected at mid-course using a Faraday mirror. We have built a prototype system based on standard te…
We have improved the hardware and software of our autocompensating system for quantum key distribution by replacing bulk optical components at the end stations with fiber-optic equivalents and implementing software that synchronizes end-station activities, communicates basis choices, corrects errors and performs privacy amplification over a local area network. The all fiber-optic arrangement provides stable, efficient and high-contrast routing of the photons. The low bit error rate leads to high error correction efficiency and minimizes data sacrifice during privacy amplification. Characteriza…
The article is focused on research of an attack on the quantum key distribution system and proposes a countermeasure method. Particularly noteworthy is that this is not a classic attack on a quantum protocol. We describe an attack on the process of calibration. Results of the research show that quantum key distribution systems have vulnerabilities not only in the protocols, but also in other vital system components. The described type of attack does not affect the cryptographic strength of the received keys and does not point to the vulnerability of the quantum key distribution protocol. We al…
Quantum key distribution is a cryptographic primitive for the distribution of symmetric encryption keys between two parties that possess a pre-shared secret. Since the pre-shared secret is a requirement, quantum key distribution may be viewed as a key growing protocol. We note that the use of pre-shared secrets coupled with access to randomness beacons may enable key growing which, though not secure from an information-theoretic standpoint, remains quantum safe.
We consider the collective eavesdropping of the BB84 and six-state protocols. Since these protocols are symmetric in the eigenstates of conjugate bases, we consider collective attacks having the same kind of symmetry. We then show how these symmetric collective attacks are sufficiently strong in order to minimize the Devetak-Winter rates. In fact, it is quite easy to construct simple examples able to reach the unconditionally-secure key-rates of these protocols.
We introduce symmetric extensions of bipartite quantum states as a tool for analyzing protocols that distill secret key from quantum correlations. Whether the correlations are coming from a prepare-and-measure quantum key distribution scheme or from an entanglement-based scheme, the protocol has to produce effective states without a symmetric extension in order to succeed. By formulating the symmetric extension problem as a semidefinite program, we solve the problem for Bell-diagonal states. Applying this result to the six-state and BB84 schemes, we show that for the entangled states that cann…
We consider an information reconciliation protocol for quantum key distribution (QKD). In order to correct down the error rate, we suggest a method, which is based on symmetric blind information reconciliation for the low-density parity-check (LDPC) codes. We develop a subsequent verification protocol with the use of $ε$-universal hash functions, which allows verifying the identity between the keys with a certain probability.
Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use symmetric keys in such a scheme, which is quite different from that in conventional public-key cryptography. The security of our scheme is analyzed and some features are discussed. Furthermore, the state-estimation attack to a prior QPKC scheme is demonstrated.
We introduce a constructive method to calculate the achievable secret key rate for a generic class of quantum key distribution protocols, when only a finite number n of signals is given. Our approach is applicable to all scenarios in which the quantum state shared by Alice and Bob is known. In particular, we consider the six state protocol with symmetric eavesdropping attacks, and show that for a small number of signals, i.e. below the order of 10^4, the finite key rate differs significantly from the asymptotic value for n approaching infinity. However, for larger n, a good approximation of th…
A symmetric device-independent quantum key distribution (DIQKD) protocol is proposed in this paper, with Holevo limit and subadditivity of von Neumann entropy, one can bound Eve's ability with collective attack. Together with symmetry of this protocol, the state Eve prepared for Alice and Bob, and at the same time, her eavesdropping on Alice's and Bob's measurements can be definitely inferred at the assumption that Eve aims at maximizing her information gain. The optimal state under this circumstance can be solely bounded with Alice and Bob's statistical results on the quantity of Clauser-Horn…
We report on the design and performance of a point-to-point classical symmetric encryption link with fast key renewal provided by a Continuous Variable Quantum Key Distribution (CVQKD) system. Our system was operational and able to encrypt point-to-point communications during more than six months, from the end of July 2010 until the beginning of February 2011. This field test was the first demonstration of the reliability of a CVQKD system over a long period of time in a server room environment. This strengthens the potential of CVQKD for information technology security infrastructure deployme…
We investigate which bipartite quantum states admit a symmetric extension and apply the results in the analysis of noise thresholds in quantum key distribution protocols with two-way postprocessing. We find that states that admit a symmetric extension can be decomposed into a convex combination of states that admit a_pure_ symmetric extension. For a state to have a pure symmetric extension, its nonzero eigenvalues must be equal to the nonzero eigenvalues of one of the subsystems. While this does not fully characterize the set of states with a pure symmetric extension in all dimensions, it is a…
What obstructs the realization of useful quantum cryptography is single photon scheme, or entanglement which is not applicable to the current infrastructure of optical communication network. We are concerned with the following question: Can we realize the information theoretically secure symmetric key cipher under "the finite secret key" based on quantum-optical communications? A role of quantum information theory is to give an answer for such a question. As an answer for the question, a new quantum cryptography was proposed by H.P.Yuen, which can realize a secure symmetric key cipher with hig…
Symmetric informationally complete measurements (SICs) are elegant, celebrated and broadly useful discrete structures in Hilbert space. We introduce a more sophisticated discrete structure compounded by several SICs. A SIC-compound is defined to be a collection of $d^3$ vectors in $d$-dimensional Hilbert space that can be partitioned in two different ways: into $d$ SICs and into $d^2$ orthonormal bases. While a priori their existence may appear unlikely when $d>2$, we surprisingly answer it in the positive through an explicit construction for $d=4$. Remarkably this SIC-compound admits a close …
This paper presents a hybrid cryptographic protocol, using quantum and classical resources, for authentication and authorization in a network. One or more trusted servers distribute streams of entangled photons to individual resources that seek to communicate. It is assumed that each resource shares a previously distributed secret key with the trusted server, and that resources can communicate with the server using both classical and quantum channels. Resources do not share secret keys with each other, so that the key distribution problem for the network is reduced from O(n^2) to O(n). Some ad…
Quantum key distribution (QKD) is a crucial technology for information security in the future. Developing simple and efficient ways to establish QKD among multiple users are important to extend the applications of QKD in communication networks. Herein, we proposed a scheme of symmetric dispersive optics QKD (DO-QKD) and demonstrated an entanglement-based quantum network based on it. In the experiment, a broadband entanglement photon pair source was shared by end users via wavelength and space division multiplexing. The wide spectrum of generated entangled photon pairs was divided into 16 combi…
Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks. For attacking symmetric cryptography and hash functions, generic quantum attacks are substantially less powerful than they are for today's public-key cryptography. So security will degrade gradually as quantum computing resources increa…
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any $n$-qubit state that has been encrypted. Comp…
Quantum key distribution uses public discussion protocols to establish shared secret keys. In the exploration of ultimate limits to such protocols, the property of symmetric extendibility of underlying bipartite states $ρ_{AB}$ plays an important role. A bipartite state $ρ_{AB}$ is symmetric extendible if there exits a tripartite state $ρ_{ABB'}$, such that the $AB$ marginal state is identical to the $AB'$ marginal state, i.e. $ρ_{AB'}=ρ_{AB}$. For a symmetric extendible state $ρ_{AB}$, the first task of the public discussion protocol is to break this symmetric extendibility. Therefore to char…
We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single-letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity. While a channel's (unassisted) capacity for for private classical communication may be strictly larger than its quantum capacity, we will show that these capacities are equal for degradable channels, thus demonstrating the equivalence of privacy and quantum coherence in this context. We use these ideas to find new bounds on the key rate of quantum key distribut…
We propose various new techniques in quantum information theory, including a de Finetti style representation theorem for finite symmetric quantum states. As an application, we give a proof for the security of quantum key distribution which applies to arbitrary protocols.
The classification of quantum symmetric-key encryption protocol is presented. According to five elements of a quantum symmetric-key encryption protocol: plaintext, ciphertext, key, encryption algorithm and decryption algorithm, there are 32 different kinds of them. Among them, 5 kinds of protocols have already been constructed and studied, and 21 kinds of them are proved to be impossible to construct, the last 6 kinds of them are not yet presented effectively. That means the research on quantum symmetric-key encryption protocol only needs to consider with 5 kinds of them nowadays.
We investigate a new strategy for incoherent eavesdropping in Ekert's entanglement based quantum key distribution protocol. We show that under certain assumptions of symmetry the effectiveness of this strategy reduces to that of the original single qubit protocol of Bennett and Brassard.
We propose the continuous-variable quantum key distribution protocol based on the Gaussian modulation of a single quadrature of the coherent states of light, which is aimed to provide simplified implementation compared to the symmetrically modulated Gaussian coherent-state protocols. The protocol waives the necessity in phase quadrature modulation and the corresponding channel transmittance estimation. The security of the protocol against collective attacks in a generally phase-sensitive Gaussian channels is analyzed and is shown achievable upon certain conditions. Robustness of the protocol t…
We develop a new approach for asymmetric LDPC-based information reconciliation in order to adapt to the current channel state and achieve better performance and scalability in practical resource-constrained QKD systems. The new scheme combines the advantages of LDPC codes, a priori error rate estimation, rate-adaptive and blind information reconciliation techniques. We compare the performance of several asymmetric and symmetric error correction schemes using real industrial QKD setup. The proposed asymmetric algorithm achieves significantly higher throughput, providing a secret key rate very c…
We report two key distribution schemes achieved by swapping quantum entanglement. Using two Bell states, two bits of secret key can be shared between two distant parties that play symmetric and equal roles. We also address eavesdropping attacks against the schemes.
We investigate the composable security of unidimensional contin- uous variable quantum key distribution (UCVQKD), which is based on the Gaussian modulation of a single quadrature of the coherent-state of light, aiming to provide a simple implementation of key distribution compared to the symmetrically modulated Gaussian coherent-state protocols. This protocol neglects the necessity in one of the quadrature modulation in coherent-states and hence reduces the system complexity. To clarify the influence of finite-size effect and the cost of performance degeneration, we establish the relation- shi…
The quantum key distribution protocol without public announcement of bases is equipped with a two-way classical communication symmetric entanglement purification protocol. This modified key distribution protocol is unconditionally secure and has a higher tolerable error rate of 20%, which is higher than previous scheme without public announcement of bases.
The supersymmetric solutions of PT-/non-PT-symmetric and non-Hermitian deformed Morse and Pöschl-Teller potentials are obtained by solving the Schrödinger equation. The Hamiltonian hierarchy method is used to get the real energy eigenvalues and corresponding eigenfunctions. \newline {PACS:05.20.-y; 05.30.-d; 05.70. Ce; 03.65.-w}\newline {\it Keywords}{\small : Supersymmetric quantum mechanics, Hamiltonian Hierarchy Method, Morse potential, Pöschl-Teller potential}
Experimental Phase-Matching Quantum Cryptographic Conferencing in Symmetric and Asymmetric Fiber Channels
Hefei National Laboratory, University of Science and Technology of China（中国科学技术大学合肥国家实验室）；Hefei National Research Center for Physical Sciences at the Microscale and School of Physical Sciences, University of Science and Technology of China（中国科学技术大学微尺度物质科学国家研究中心物理学院）；CAS Center for Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China（中国科学技术大学量子信息科学研究院）；School of Cyberspace, Hangzhou Dianzi University（杭州电子科技大学网络空间学院）；Pinghu Digital Technology Innovation Research Institute, Hangzhou Dianzi University（杭州电子科技大学平湖数字技术创新研究院）；Shanghai Research Center for Quantum Science and CAS Center for Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China（中国科学技术大学上海量子科学研究中心和量子信息科学研究院）
As an alternative to the usual key generation by two-way communication in schemes for quantum cryptography, we consider codes for key generation by one-way communication. We study codes that could be applied to the raw key sequences that are ideally obtained in recently proposed scenarios for quantum key distribution, which can be regarded as communication through symmetric four-letter channels.
We analyze the security against collective attacks for a homodyne-based continuous-variable quantum key distribution protocol using binary coherent states and postselection. We derive a lower bound of the secret key rate in an asymptotic scenario, and numerically optimize it for the case of a symmetric Gaussian channel.
Studies on symmetric extendibility of quantum states become especially important in a context of analysis of one-way quantum measures of entanglement, distilabillity and security of quantum protocols. In this paper we analyse composite systems containing a symmetric extendible part with a particular attention devoted to one-way security of such systems. Further, we introduce a new one-way monotone based on the best symmetric approximation of quantum state. We underpin those results with geometric observations on structures of multi-party settings which posses in sub-spaces substantial symmetri…
Bound secret information is classical information that contains secrecy but from which secrecy cannot be extracted. The existence of bound secrecy has been conjectured but is currently unproven, and in this work we provide analytical and numerical evidence for its existence. Specifically, we consider two-way post-processing protocols in prepare-and-measure quantum key distribution based on the well-known six-state signal states. In terms of the quantum bit-error rate $Q$ of the classical data, such protocols currently exist for $Q<\frac{5-\sqrt{5}}{10}\approx 27.6\%$. On the other hand, for $Q…
This paper introduces a novel entanglement-based QKD protocol, that makes use of a modified symmetric version of the Bernstein-Vazirani algorithm, in order to achieve a secure and efficient key distribution. Two variants of the protocol, one fully symmetric and one semi-symmetric, are presented. In both cases, the spatially separated Alice and Bob share multiple EPR pairs, one qubit of the pair each. The fully symmetric version allows both parties to input a secret key from the irrespective location and, finally, acquire in the end a totally new and original key, an idea which was inspired by …
The symmetric subpace has many applications in quantum information theory. This review article begins by explaining key background facts about the symmetric subspace from a quantum information perspective. Then we review, and in some places extend, work of Werner and Chiribella that connects the symmetric subspace to state estimation, optimal cloning, the de Finetti theorem and other topics. In the third and final section, we discuss how the symmetric subspace can yield concentration-of-measure results via the calculation of higher moments of random quantum states. There are no new results in …
An application of quantum communications is the transmission of qubits to create shared symmetric encryption keys in a process called Quantum Key Distribution (QKD). Contrary to public-private key encryption, symmetric encryption is safe from (quantum) computing attacks, i.e. it provides forward security and is thus attractive for secure communications. In this paper we argue that for free-space quantum communications, especially with satellites, if one assumes that man-in-the-middle attacks can be detected by classical channel monitoring techniques, simplified quantum communications protocols…
Quantum key distribution (QKD) can provide information theoretically secure key exchange even in the era of quantum computer. However, QKD requires the classical channel to be authenticated, and the current method is pre-sharing symmetric keys. For a QKD network of $n$ users, this method requires $C_n^2 = n(n-1)/2$ pairs of symmetric keys to realize pairwise interconnection. In contrast, with the help of mature public key infrastructure (PKI) and post-quantum cryptography (PQC) with quantum resistant security, each user only needs to apply for a digital certificate from certificate authority (…
We propose an entanglement distillation and purification scheme for symmetric two-mode entangled Gaussian states that allows to asymptotically extract a pure entangled Gaussian state from any input entangled symmetric Gaussian state. The proposed scheme is a modified and extended version of the entanglement distillation protocol originally developed by [Browne et al., Phys. Rev. A 67, 062320 (2003)]. A key feature of the present protocol is that it utilizes a two-copy de-Gaussification procedure that involves a Mach-Zehnder interferometer with single-mode non-Gaussian filters inserted in its t…
We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon's algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives. Specifically, these examples consist of a quantum distinguisher for the 3-round Feistel network and a forgery attack on CBC-MAC which forges a tag for a chosen-prefix message querying only other messages (of the same length). We assume that an adversary has quantum-oracle access to the respective classical primitives. Similar results have been achieved re…
Quantum Key Distribution or QKD provides symmetric key distribution using the quantum mechanics/channels with new security properties. The security of QKD relies on the difficulty of the quantum state discrimination problem. We discover that the recent developments in $\mathcal{PT}$ symmetry can be used to expedite the quantum state discrimination problem and therefore to attack the BB84 QKD scheme. We analyze the security of the BB84 scheme and show that the attack significantly increases the eavesdropping success rate over the previous Hermitian quantum state discrimination approach. We desi…
In this paper, we report the first quantum key-recovery attack on a symmetric block cipher design, using classical queries only, with a more than quadratic time speedup compared to the best classical attack. We study the 2XOR-Cascade construction of Gaži and Tessaro (EUROCRYPT~2012). It is a key length extension technique which provides an n-bit block cipher with 5n/2 bits of security out of an n-bit block cipher with 2n bits of key, with a security proof in the ideal model. We show that the offline-Simon algorithm of Bonnetain et al. (ASIACRYPT~2019) can be extended to, in particular, attack …
Quantum key distribution (QKD) is a quantum-proof key-exchange scheme which is fast approaching the communication industry. An essential component in QKD is the information reconciliation step, which is used for correcting the quantum-channel noise errors. The recently suggested blind reconciliation technique, based on low-density parity-check (LDPC) codes, offers remarkable prospectives for efficient information reconciliation without an a priori error rate estimation. We suggest an improvement of the blind-information-reconciliation protocol promoting a significant increase in the efficiency…
Recent results of Kaplan et al., building on previous work by Kuwakado and Morii, have shown that a wide variety of classically-secure symmetric-key cryptosystems can be completely broken by quantum chosen-plaintext attacks (qCPA). In such an attack, the quantum adversary has the ability to query the cryptographic functionality in superposition. The vulnerable cryptosystems include the Even-Mansour block cipher, the three-round Feistel network, the Encrypted-CBC-MAC, and many others. In this work, we study simple algebraic adaptations of such schemes that replace $(\mathbb Z/2)^n$ addition wit…
Secure information retrieval is an essential task in today's highly digitised society. In some applications, it may be necessary that user query's privacy and database content's security are enforced. For these settings, symmetric private information retrieval (SPIR) could be employed, but its implementation is known to be demanding, requiring a private key-exchange network as the base layer. Here, we report for the first time a realisation of provably-secure SPIR supported by a quantum-secure key-exchange network. The SPIR scheme looks at biometric security, offering secure retrieval of 582-b…
We consider the continuous-variable protocol of Pirandola et al. [Nature Photonics 9, 397-402 (2015), see also arXiv.1312.4104] where the secret-key is established by the measurement of an untrusted relay. In this network protocol, two authorized parties are connected to an untrusted relay by insecure quantum links. Secret correlations are generated by a continuous-variable Bell detection performed on incoming coherent states. In the present work we provide a detailed study of the symmetric configuration, where the relay is midway between the parties. We analyze symmetric eavesdropping strateg…
Private information retrieval (PIR) is a database query protocol that provides user privacy, in that the user can learn a particular entry of the database of his interest but his query would be hidden from the data centre. Symmetric private information retrieval (SPIR) takes PIR further by additionally offering database privacy, where the user cannot learn any additional entries of the database. Unconditionally secure SPIR solutions with multiple databases are known classically, but are unrealistic because they require long shared secret keys between the parties for secure communication and sh…
Quantum Key Distribution (QKD) is an approach for establishing symmetrical binary keys between distant users in an information-theoretically secure way. In this paper we provide an overview of existing solutions that integrate QKD within the most popular architecture for establishing secure communications in modern IP (Internet Protocol) networks - IPsec (Internet Protocol security). The provided overview can be used to further design the integration of QKD within the IPsec architecture striving for a standardized solution.
