Corpus ID: 222272203

Device-independent quantum key distribution from computational assumptions.

  title={Device-independent quantum key distribution from computational assumptions.},
  author={Tony Metger and Yfke Dulek and Andrea Coladangelo and Rotem Arnon-Friedman},
  journal={arXiv: Quantum Physics},
In device-independent quantum key distribution (DIQKD), an adversary prepares a device consisting of two components, distributed to Alice and Bob, who use the device to generate a secure key. The security of existing DIQKD schemes holds under the assumption that the two components of the device cannot communicate with one another during the protocol execution. However, in practice, entanglement is distributed "on the fly" via a quantum channel connecting the two components, and Alice and Bob… Expand

Figures from this paper

Depth-efficient proofs of quantumness
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover canExpand
Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States
This work proposes a different approach, and starts the study of Non-Destructive Zero-Knowledge Proofs on Quantum States, and shows how it can prove useful to distribute a GHZ state between different parties, in such a way that only parties knowing a secret can be part of this GHZ. Expand
Self-Testing of a Single Quantum Device Under Computational Assumptions
A protocol is constructed that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements. Expand
Test of Quantumness with Small-Depth Quantum Circuits
This paper shows that this test of quantumness, and essentially all the above applications, can actually be implemented by a very weak class of quantum circuits: constant-depth quantum circuits combined with logarithmic-depth classical computation. Expand


Towards a formal definition of security for quantum protocols
This thesis presents a formal model for quantum protocols, that is, cryptographic protocols based on quantum mechanics. It also develops a definition of security (which includes notions such asExpand
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)Expand
and T
  • Vidick, in Proceedings of the 59th Annual Symposium on Foundations of Computer Science
  • 2018
Communications in Mathematical Physics 347
  • 291
  • 2016
and S
  • Pironio,
  • 2020
and T
  • Zhang, in Annual International Cryptology Conference
  • 2020
and T
  • Vidick,
  • 2020
SIAM Journal on Computing 48
  • 181
  • 2019
and N
  • Brunner,
  • 2019
Journal of Cryptology 31
  • 965
  • 2018