47 research outputs found
Quantum cryptography: key distribution and beyond
Uniquely among the sciences, quantum cryptography has driven both
foundational research as well as practical real-life applications. We review
the progress of quantum cryptography in the last decade, covering quantum key
distribution and other applications.Comment: It's a review on quantum cryptography and it is not restricted to QK
Fair Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated
players, who in principle do not trust each other, wish to establish a common
random bit. If we limit ourselves to classical communication, this task
requires either assumptions on the computational power of the players or it
requires them to send messages to each other with sufficient simultaneity to
force their complete independence. Without such assumptions, all classical
protocols are so that one dishonest player has complete control over the
outcome. If we use quantum communication, on the other hand, protocols have
been introduced that limit the maximal bias that dishonest players can produce.
However, those protocols would be very difficult to implement in practice
because they are susceptible to realistic losses on the quantum channel between
the players or in their quantum memory and measurement apparatus. In this
paper, we introduce a novel quantum protocol and we prove that it is completely
impervious to loss. The protocol is fair in the sense that either player has
the same probability of success in cheating attempts at biasing the outcome of
the coin flip. We also give explicit and optimal cheating strategies for both
players.Comment: 12 pages, 1 figure; various minor typos corrected in version
The Security of Practical Quantum Key Distribution
Quantum key distribution (QKD) is the first quantum information task to reach
the level of mature technology, already fit for commercialization. It aims at
the creation of a secret key between authorized partners connected by a quantum
channel and a classical authenticated channel. The security of the key can in
principle be guaranteed without putting any restriction on the eavesdropper's
power.
The first two sections provide a concise up-to-date review of QKD, biased
toward the practical side. The rest of the paper presents the essential
theoretical tools that have been developed to assess the security of the main
experimental platforms (discrete variables, continuous variables and
distributed-phase-reference protocols).Comment: Identical to the published version, up to cosmetic editorial change
Assumptions in Quantum Cryptography
Quantum cryptography uses techniques and ideas from physics and computer
science. The combination of these ideas makes the security proofs of quantum
cryptography a complicated task. To prove that a quantum-cryptography protocol
is secure, assumptions are made about the protocol and its devices. If these
assumptions are not justified in an implementation then an eavesdropper may
break the security of the protocol. Therefore, security is crucially dependent
on which assumptions are made and how justified the assumptions are in an
implementation of the protocol.
This thesis is primarily a review that analyzes and clarifies the connection
between the security proofs of quantum-cryptography protocols and their
experimental implementations. In particular, we focus on quantum key
distribution: the task of distributing a secret random key between two parties.
We provide a comprehensive introduction to several concepts: quantum mechanics
using the density operator formalism, quantum cryptography, and quantum key
distribution. We define security for quantum key distribution and outline
several mathematical techniques that can either be used to prove security or
simplify security proofs. In addition, we analyze the assumptions made in
quantum cryptography and how they may or may not be justified in
implementations.
Along with the review, we propose a framework that decomposes
quantum-key-distribution protocols and their assumptions into several classes.
Protocol classes can be used to clarify which proof techniques apply to which
kinds of protocols. Assumption classes can be used to specify which assumptions
are justified in implementations and which could be exploited by an
eavesdropper. Two contributions of the author are discussed: the security
proofs of two two-way quantum-key-distribution protocols and an intuitive proof
of the data-processing inequality.Comment: PhD Thesis, 221 page
Quantum Cryptography: Key Distribution and Beyond
Uniquely among the sciences, quantum cryptography has driven both foundational research as well as practical real-life applications. We review the progress of quantum cryptography in the last decade, covering quantum key distribution and other applications.Quanta 2017; 6: 1–47