Related papers: Security proof for QKD systems with threshold dete…
We construct a practically implementable classical processing for the BB84 protocol and the six-state protocol that fully utilizes the accurate channel estimation method, which is also known as the quantum tomography. Our proposed…
We show that the security proof of the Bennett 1992 protocol over loss-free channel in (K. Tamaki, M. Koashi, and N. Imoto, Phys. Rev. Lett. 90, 167904 (2003)) can be adapted to accommodate loss. We assumed that Bob's detectors discriminate…
We analyze the set of two-qubit states from which a secret key can be extracted by single-copy measurements plus classical processing of the outcomes. We introduce a key distillation protocol and give the corresponding necessary and…
Quantum key distribution (QKD) has undergone significant development in recent decades, particularly with respect to free-space (air) and optical fiber channels. Here, we report the first proof-of-principle experiment for the BB84 protocol…
A protocol for multiparty quantum secret splitting (MQSS) with an ordered $N$ Einstein-Podolsky-Rosen (EPR) pairs and Bell state measurements is recently proposed by Deng {\rm et al.} [Phys. Lett. A 354(2006)190]. We analyzed the security…
Quantum key distribution (QKD) is theoretically secure using the principle of quantum mechanics; therefore, QKD is a promising solution for the future of secure communication. Although several experimental demonstrations of QKD have been…
Several protocols for controlled teleportation were suggested by Yang, Chu, and Han [PRA 70, 022329 (2004)]. In these protocols, Alice teleports qubits (in an unknown state) to Bob iff a controller allows it. We view this problem in the…
The Shor-Preskill proof of the security of the BB84 quantum key distribution protocol relies on the theoretical existence of good classical error-correcting codes with the ``dual-containing'' property. A practical implementation of BB84…
Security proofs of quantum key distribution (QKD) typically assume that the devices of the legitimate users are perfectly shielded from the eavesdropper. This assumption is, however, very hard to meet in practice, and thus the security of…
We describe the popular BB84 protocol and critically examine its security proof as presented by Shor and Preskill. The proof requires the use of quantum error correcting codes called the Calderbank-Shor-Steanne (CSS) quantum codes. These…
Basic techniques to prove the unconditional security of quantum cryptography are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard in 1984. The proof considers a practical variation on the…
Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have…
One of the simplest methods for implementing quantum key distribution over fiber-optic communication is the Bennett-Brassard 1984 protocol with phase encoding (PE-BB84 protocol), in which the sender uses phase modulation over double pulses…
Quantum Key Distribution (QKD) with classical Bob has recently been suggested and proven robust. Following this work, QKD with classical Alice was also suggested and proven robust. The above protocols are ideal in the sense that they make…
Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully-fledged quantum computer,…
We introduce a quantum cloning bound which we apply to a straightforward and relatively direct security proof of the prepare-and-measure Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol against collective attacks. The…
We present a scheme for hiding bits in Bell states that is secure even when the sharers Alice and Bob are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain…
Quantum key distribution (QKD) seeks to provide a method of generating cryptographically-secure keys between remote parties while guaranteeing unconditional security. Implementations of high-dimensional QKD using dispersive-optics (DO-QKD)…
The relation between Bell inequalities with two two-outcome measurements per site and distillability is analyzed in systems of an arbitrary number of quantum bits. We observe that the violation of any of these inequalities by a quantum…
Quantum key distribution (QKD) is the most explored application of quantum information theory. A central problem in entanglement-based QKD (EB-QKD), is whether every entangled state can be used to extract a key. We observe that entanglement…