Results 1  10
of
189
Proof of security of quantum key distribution with twoway classical communications
, 2002
"... ..."
Information and Computation: Classical and Quantum Aspects
 REVIEWS OF MODERN PHYSICS
, 2001
"... Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways, as well as information processing with an efficiency largely ..."
Abstract

Cited by 36 (3 self)
 Add to MetaCart
Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways, as well as information processing with an efficiency largely surpassing that of the present and foreseeable classical computers. Some outstanding aspects of classical and quantum information theory will be addressed here. Quantum teleportation, dense coding, and quantum cryptography are discussed as a few samples of the impact of quanta in the transmission of information. Quantum logic gates and quantum algorithms are also discussed as instances of the improvement in information processing by a quantum computer. We provide finally some examples of current experimental
Reconciliation of a QuantumDistributed Gaussian Key
, 2001
"... Two parties, Alice and Bob, wish to distill a binary secret key out of a list of Gaussian variables that were distributed with the help of quantum cryptography. We present a novel construction that allows the legitimate parties to get equal strings out of correlated variables, using a classical chan ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
Two parties, Alice and Bob, wish to distill a binary secret key out of a list of Gaussian variables that were distributed with the help of quantum cryptography. We present a novel construction that allows the legitimate parties to get equal strings out of correlated variables, using a classical channel, with as few leaked information as possible. This opens the way to securely correcting nonbinary key elements. In particular, the construction is refined to the case of Gaussiandistributed variables as it applies directly to a quantum cryptography protocol developed recently.
LongDistance Quantum Communication With Entangled Photons Using Satellites
 IEEE J. Sel. Top. Quant. Elec. 9
, 2003
"... Abstract—The use of satellites to distribute entangled photon pairs (and single photons) provides a unique solution for longdistance quantum communication networks. This overcomes the principle limitations of Earthbound technology, i.e., the range of the order of 100 km afforded by both optical fi ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
(Show Context)
Abstract—The use of satellites to distribute entangled photon pairs (and single photons) provides a unique solution for longdistance quantum communication networks. This overcomes the principle limitations of Earthbound technology, i.e., the range of the order of 100 km afforded by both optical fiber and by terrestrial freespace links. Index Terms—Quantum communication, quantum entanglement, satellite applications, space technology. I.
Efficient reconciliation protocol for discretevariable
, 2009
"... Reconciliation is an essential part of any secretkey agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of informati ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Reconciliation is an essential part of any secretkey agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discretevariable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the BSC. In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.
Using Quantum Key Distribution within IPSEC to secure MAN communications
 In MAN 2005 conference
, 2005
"... ABSTRACT. Quantum cryptography could be integrated in various existing concepts and protocols to secure Metropolitan Area Networks communications. One of the possible use of quantum cryptography is within IPSEC. The applications of quantum cryptography are linked to telecommunication services that r ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
ABSTRACT. Quantum cryptography could be integrated in various existing concepts and protocols to secure Metropolitan Area Networks communications. One of the possible use of quantum cryptography is within IPSEC. The applications of quantum cryptography are linked to telecommunication services that require very high level of security in Metropolitan Area Networks. The aim of this paper is to analyse the use of quantum cryptography within IPSEC to secure MAN communications and to present the estimated performances of this solution. We analyse classical IPSEC advantage and limits to point out how quantum cryptography could enhance the security level of IPSEC. After having introduced basic concepts in quantum cryptography, we propose a solution that integrate quantum key distribution into IPSEC. A performance analysis is done to demonstrate the operational feasibility of this solution.
ROBUST CRYPTOGRAPHY IN THE NOISYQUANTUMSTORAGE MODEL
, 2009
"... It was shown in [42] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the universal task of oblivious transfer that can be implemented using quantumkeydistribution (QKD) hardware in the practica ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
It was shown in [42] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the universal task of oblivious transfer that can be implemented using quantumkeydistribution (QKD) hardware in the practical setting where honest participants are unable to perform noisefree operations. We derive tradeoffs between the amount of storage noise, the amount of noise in the operations performed by the honest participants and the security of oblivious transfer which are greatly improved compared to the results in [42]. As an example, we show that for the case of depolarizing noise in storage we can obtain secure oblivious transfer as long as the quantum biterror rate of the channel does not exceed 11 % and the noise on the channel is strictly less than the quantum storage noise. This is optimal for the protocol considered. Finally, we show that our analysis easily carries over to quantum protocols for secure identification.
Quantum state discrimination
, 2008
"... It is a fundamental consequence of the superposition principle for quantum states that there must exist nonorthogonal states, that is states that, although different, have a nonzero overlap. This finite overlap means that there is no way of determining with certainty in which of two such states a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
It is a fundamental consequence of the superposition principle for quantum states that there must exist nonorthogonal states, that is states that, although different, have a nonzero overlap. This finite overlap means that there is no way of determining with certainty in which of two such states a given physical system has been prepared. We review the various strategies that have been devised to discriminate optimally between nonorthogonal states and some of the optical experiments that have been performed to realise these.