Metraipolis › archive › dc_cb42e91807cd

A Cheat-Sensitive Primitive for Destination-Private Quantum Routing — arXiv:2610.04359

Source: arXiv
Original: https://arxiv.org/abs/2610.04359
License (as archived): CC0-1.0
Archived: 2026-10-06T05:30:00.635Z
SHA-256 of the archived text: 28e411a6f68510abd90b48276adf048eef34cfd5326f56013ec97109d447ae2e
Stable URL of this page: https://metraipolis.com/documento/dc_cb42e91807cd

How to cite

A Cheat-Sensitive Primitive for Destination-Private Quantum Routing — arXiv:2610.04359 — arXiv, https://arxiv.org/abs/2610.04359 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb42e91807cd (Metraipolis archive dc_cb42e91807cd, sha256 28e411a6f68510abd90b48276adf048eef34cfd5326f56013ec97109d447ae2e)

BibTeX

@misc{dccb42e91807cd,
  title = {A Cheat-Sensitive Primitive for Destination-Private Quantum Routing — arXiv:2610.04359},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.04359},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb42e91807cd; sha256 28e411a6f68510abd90b48276adf048eef34cfd5326f56013ec97109d447ae2e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.04359. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum networks will rely on intermediate nodes to distribute entanglement, but the same nodes may learn which users are being connected. We introduce a minimal two-call routing primitive in which a user, Alice, establishes an entangled link with one of several clients while testing whether the provider, Bob, has disturbed a coherently encoded request. The construction adapts the hidden-order mechanism of quantum private queries: one call contains a direct request, the other a coherent superposition of the desired and null addresses, and Alice keeps their order secret. A private matching qubit held by the selected client restores the coherent test state after a favorable Bell-measurement outcome, so that Alice can test the returned query without any further operation by Bob. The claim is deliberately limited. The protocol shows that a routing request can carry a physical cheating test, and it detects an explicit destination-reading attack with nonzero probability. It does not yet provide a quantitative information-disturbance tradeoff, composable security, or certification of an unmeasured output against arbitrary attacks. We also characterize the exact perfect-pass limit, in which Bob's residual state, averaged over the private matching states, is independent of the destination.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2610.04359 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:26:35.381Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).