Cryptography in a Quantum World

Abstract

Quantum computing had a profound impact on cryptography. Shor's discovery of an efficient quantum algorithm for factoring large integers implies that many existing classical systems based on computational assumptions can be broken, once a quantum computer is built. It is therefore imperative to find other means of implementing secure protocols. This thesis aims to contribute to the understanding of both the physical limitations, as well as the possibilities of cryptography in the quantum setting. In particular, we investigate several questions that are crucial to the security of quantum protocols: How can we find good uncertainty relations for a large number of measurement settings? How does the presence of entanglement affect classical protocols? And, what limitations does entanglement impose on implementing quantum protocols? Finally, can we circumvent some of those limitations using realistic assumptions?

PhD Thesis, University of Amsterdam, 27 February 2008. 279 pages, 32 figures

References in corpus (11)

• A complete family of separability criteria
• Randomizing quantum states: Constructions and applications
• Characterizing quantum theory in terms of information-theoretic constraints
• Detecting multipartite entanglement
• Implications of Superstrong Nonlocality for Cryptography
• Multiparty data hiding of quantum information
• Quantum weak coin flipping with arbitrarily small bias
• A large family of quantum weak coin-flipping protocols
• Cryptography In the Bounded Quantum-Storage Model
• Entropic uncertainty relations for incomplete sets of mutually unbiased observables
• Computing finite-dimensional bipartite quantum separability