Secure quantum key distribution with realistic devices
In principle, quantum key distribution (QKD) offers information-theoretic security based on
the laws of physics. In practice, however, the imperfections of realistic devices might …
the laws of physics. In practice, however, the imperfections of realistic devices might …
Security in quantum cryptography
Quantum cryptography exploits principles of quantum physics for the secure processing of
information. A prominent example is secure communication, ie, the task of transmitting …
information. A prominent example is secure communication, ie, the task of transmitting …
Entropic uncertainty relations and their applications
Heisenberg's uncertainty principle forms a fundamental element of quantum mechanics.
Uncertainty relations in terms of entropies were initially proposed to deal with conceptual …
Uncertainty relations in terms of entropies were initially proposed to deal with conceptual …
Quantum cryptography: Key distribution and beyond
Quantum Cryptography: Key Distribution and Beyond Page 1 Quantum Cryptography: Key
Distribution and Beyond Akshata Shenoy-Hejamadi 1, Anirban Pathak 2 & Srikanth …
Distribution and Beyond Akshata Shenoy-Hejamadi 1, Anirban Pathak 2 & Srikanth …
Experimental bit commitment based on quantum communication and special relativity
Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a
secret bit to Alice. Perfectly secure bit commitment between two mistrustful parties is …
secret bit to Alice. Perfectly secure bit commitment between two mistrustful parties is …
Quantum position verification in the random oracle model
D Unruh - Advances in Cryptology–CRYPTO 2014: 34th Annual …, 2014 - Springer
We present a quantum position verification scheme in the random oracle model. In contrast
to prior work, our scheme does not require bounded storage/retrieval/entanglement …
to prior work, our scheme does not require bounded storage/retrieval/entanglement …
Causal boxes: quantum information-processing systems closed under composition
Complex information-processing systems, for example, quantum circuits, cryptographic
protocols, or multi-player games, are naturally described as networks composed of more …
protocols, or multi-player games, are naturally described as networks composed of more …
Practical relativistic bit commitment
Bit commitment is a fundamental cryptographic primitive in which Alice wishes to commit a
secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is …
secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is …
Entropic uncertainty from effective anticommutators
We investigate entropic uncertainty relations for two or more binary measurements, for
example, spin-1 2 or polarization measurements. We argue that the effective …
example, spin-1 2 or polarization measurements. We argue that the effective …
Device-independent two-party cryptography secure against sequential attacks
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common
tasks without the need for mutual trust. Examples of such tasks are private access to a …
tasks without the need for mutual trust. Examples of such tasks are private access to a …