pith. sign in

arxiv: quant-ph/0606049 · v5 · pith:QTMZ7XEGnew · submitted 2006-06-06 · 🪐 quant-ph · cs.CR

Full security of quantum key distribution from no-signaling constraints

classification 🪐 quant-ph cs.CR
keywords securityassumptionbelldevicesdistributedindependentnon-signalingonly
0
0 comments X
read the original abstract

We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers, constrained only by the assumption that any information accessible to them must be compatible with the non-signaling principle. The claim holds with respect to the state-of-the-art security definition used in cryptography, known as universally-composable security. The non-signaling assumption only refers to the statistics of measurement outcomes depending on the choices of measurements; hence security is independent of the internal workings of the devices --- they do not even need to follow the laws of quantum theory. This is relevant for practice as a correct and complete modeling of realistic devices is generally impossible. The techniques developed are general and can be applied to other Bell inequality-based protocols. In particular, we provide a scheme for estimating Bell-inequality violations when the samples are not independent and identically distributed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Lower overhead fault-tolerant building blocks for noisy quantum computers

    quant-ph 2026-05 unverdicted novelty 5.0

    New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.