81,034 research outputs found
Efficient quantum key distribution over a collective noise channel
We present two efficient quantum key distribution schemes over two different
collective-noise channels. The accepted hypothesis of collective noise is that
photons travel inside a time window small compared to the variation of noise.
Noiseless subspaces are made up of two Bell states and the spatial degree of
freedom is introduced to form two nonorthogonal bases. Although these protocols
resort to entangled states for encoding the key bit, the receiver is only
required to perform single-particle product measurements and there is no basis
mismatch. Moreover, the detection is passive as the receiver does not switch
his measurements between two conjugate measurement bases to get the key.Comment: 6 pages, 1 figure; the revised version of the paper published in
Phys. Rev. A 78, 022321 (2008). Some negligible errors on the error rates of
eavesdropping check are correcte
Continuous Variable Quantum Cryptography using Two-Way Quantum Communication
Quantum cryptography has been recently extended to continuous variable
systems, e.g., the bosonic modes of the electromagnetic field. In particular,
several cryptographic protocols have been proposed and experimentally
implemented using bosonic modes with Gaussian statistics. Such protocols have
shown the possibility of reaching very high secret-key rates, even in the
presence of strong losses in the quantum communication channel. Despite this
robustness to loss, their security can be affected by more general attacks
where extra Gaussian noise is introduced by the eavesdropper. In this general
scenario we show a "hardware solution" for enhancing the security thresholds of
these protocols. This is possible by extending them to a two-way quantum
communication where subsequent uses of the quantum channel are suitably
combined. In the resulting two-way schemes, one of the honest parties assists
the secret encoding of the other with the chance of a non-trivial superadditive
enhancement of the security thresholds. Such results enable the extension of
quantum cryptography to more complex quantum communications.Comment: 12 pages, 7 figures, REVTe
Using of small-scale quantum computers in cryptography with many-qubit entangled states
We propose a new cryptographic protocol. It is suggested to encode
information in ordinary binary form into many-qubit entangled states with the
help of a quantum computer. A state of qubits (realized, e.g., with photons) is
transmitted through a quantum channel to the addressee, who applies a quantum
computer tuned to realize the inverse unitary transformation decoding of the
message. Different ways of eavesdropping are considered, and an estimate of the
time needed for determining the secret unitary transformation is given. It is
shown that using even small quantum computers can serve as a basis for very
efficient cryptographic protocols. For a suggested cryptographic protocol, the
time scale on which communication can be considered secure is exponential in
the number of qubits in the entangled states and in the number of gates used to
construct the quantum network
Quantum authentication with key recycling
We show that a family of quantum authentication protocols introduced in
[Barnum et al., FOCS 2002] can be used to construct a secure quantum channel
and additionally recycle all of the secret key if the message is successfully
authenticated, and recycle part of the key if tampering is detected. We give a
full security proof that constructs the secure channel given only insecure
noisy channels and a shared secret key. We also prove that the number of
recycled key bits is optimal for this family of protocols, i.e., there exists
an adversarial strategy to obtain all non-recycled bits. Previous works
recycled less key and only gave partial security proofs, since they did not
consider all possible distinguishers (environments) that may be used to
distinguish the real setting from the ideal secure quantum channel and secret
key resource.Comment: 38+17 pages, 13 figures. v2: constructed ideal secure channel and
secret key resource have been slightly redefined; also added a proof in the
appendix for quantum authentication without key recycling that has better
parameters and only requires weak purity testing code
- …