Experimental Quantum Cryptography

@article{Bennett1990ExperimentalQC,
  title={Experimental Quantum Cryptography},
  author={Charles H. Bennett and François Bessette and Gilles Brassard and Louis Salvail and John A. Smolin},
  journal={J. Cryptol.},
  year={1990},
  volume={5},
  pages={3-28}
}
We describe initial results from an apparatus and protocol designed to implement quantum public key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion of the sent and received versions of this transmission estimate the extent of eavesdropping that might have taken place on it, and finally 3) if this estimate is small enough, can distill… 
Quantum cryptography with imperfect apparatus
  • D. Mayers, A. Yao
  • Computer Science, Physics
    Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
TLDR
This paper proposes and gives a concrete design for a new concept, self-checking source, which requires the manufacturer of the photon source to provide certain tests; these tests are designed such that, if passed, the source is guaranteed to be adequate for the security of the quantum key distribution protocol, even though the testing devices may not be built to the original specification.
QUANTUM KEY DISTRIBUTION THROUGH AN ANISOTROPIC DEPOLARIZING QUANTUM CHANNEL
Quantum cryptography is one of the major applications of quantum information theories. However, the Quantum key distribution (QKD) introduced by Bennett and Brassard in 1984 which is known as BB84
Practical Quantum Oblivious
We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties (\Alice") transmits two one-bit messages in such a
Practical Quantum Oblivious Transfer
We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two one-bit messages in such a
Unconditional security of practical quantum key distribution
TLDR
This paper is identical to the preprint arXiv:quant-ph/0107017, which was finalized in 2001, therefore, some of the more recent developments, including the question of composability, are not addressed.
Practical security of quantum cryptography
The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an
Experimental realization of three quantum key distribution protocols
TLDR
Experimental verification of the BB84 protocol using three bases and experimental implementation of the B92 protocol, which was introduced by Charles Bennett in the year 1992, are performed.
Full-field implementation of a perfect eavesdropper on a quantum cryptography system.
TLDR
It is shown that non-idealities in physical implementations of QKD can be fully practically exploitable, and must be given increased scrutiny if quantum cryptography is to become highly secure.
Quantum Cryptography
TLDR
A remarkable surge of interest in the international scientific and industrial community has propelled quantum cryptography into mainstream computer science and physics and it is becoming increasingly practical at a fast pace.
Fully device independent quantum key distribution
TLDR
This work rigorously proves the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution and builds on techniques from the classical theory of pseudo-randomness to achieve a new quantitative understanding of the non-local nature of quantum correlations.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
Practical Quantum Oblivious Transfer
We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two one-bit messages in such a
Quantum cryptography without Bell's theorem.
TLDR
A related but simpler EPR scheme is described and it is proved it secure against more general attacks, including substitution of a fake EPR source and the original 1984 key distribution scheme of Bennett and Brassard, which uses single particles instead of EPR pairs.
Quantum Cryptography, or Unforgeable Subway Tokens
TLDR
The use of quantum mechanical systems to record information gives rise to novel cryptographic phenomena, not achievable with classical recording media, including the multiplexing of two messages in such a way that either message may be recovered at the cost of irreversibly destroying the other.
An Update on Quantum Cryptography
TLDR
It is proved that no technology whatsoever, as well as no amount of computing power, could break some of the authors' schemes, as long as some of the most fundamental principles of quantum physics hold true.
Experimental quantum cryptography: the dawn of a new era for quantum cryptography: the experimental prototype is working]
Quantum cryptography has recently entered the experimental era . The first convincingl y successful quantum exchange took place a few weeks ago . After a short historical revie w of quantum
Correct and private reductions among oblivious transfers
TLDR
This work formalizes the notion of a reduction, that is a method by which one form of oblivious transfer can be achieved under the assumption that another form exists abstractly, and shows correct and private reductions between various notions of oblivioustransfer.
Achieving oblivious transfer using weakened security assumptions
  • C. Crépeau, J. Kilian
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
The authors present some general techniques for establishing the cryptographic strength of a wide variety of games and show that a noisy telephone line is in fact a very sophisticated cryptographic device.
How to Reduce Your Enemy's Information (Extended Abstract)
TLDR
If no eavesdropping occurred over the private channel, it is possible for Alice and Bob to publicly verify that no transmission errors nor tampering occurred either, and end up with an entirely secret final string that is only K bits shorter than the original private transmission.
Advances in cryptology--CRYPTO '91 : proceedings
Protocol Design and Analysis.- A Calculus for Access Control in Distributed Systems.- Deriving the Complete Knowledge of Participants in Cryptographic Protocols.- Systematic Design of Two-Party
New Hash Functions and Their Use in Authentication and Set Equality
TLDR
Several new classes of hash functions with certain desirable properties are exhibited, and two novel applications for hashing which make use of these functions are introduced, including a provably secure authentication technique for sending messages over insecure lines and the application of testing sets for equality.
...
1
2
3
4
5
...