Pith. sign in

REVIEW 2 cited by

Relaxing Trust Assumptions on Quantum Key Distribution Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.13136 v2 pith:4IA2356O submitted 2024-02-20 quant-ph cs.NI

classification quant-phcs.NI
keywords trustmanagementaccessrelaysdifferentnetworknetworksquantum
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Quantum security over long distances with untrusted relays is largely unfounded and is still an open question for active research. Nevertheless, quantum networks based on trusted relays are being built across the globe. However, standard QKD network architecture implores a complete trust requirement on QKD relays, which is too demanding and limits the use cases for QKD networks. In this work, we explore the possibility to securely relay a secret in a QKD network by relaxing the trust assumptions (if not completely) on the relay. We characterize QKD relays with different trust levels, namely, Full Access Trust (FAT), Partial Access Trust (PAT), and No Access Trust (NAT). As the name suggests, each level defines the degree with which a relay is required to be trusted with the secret provided by the key management system for end-to-end communication. We then review and propose multiple constructions of the QKD key management system based on the different trust levels. Main contribution of the paper is realized by evaluating key management systems with no access trust level. In principle, we review key management with centralized topology and propose a new decentralized key management system. These different topologies provide various advantages based on the QKD network requirements, allowing an operational flexibility in the architecture. We believe this work presents a new perspective to the open problem of providing a confiding and a practical solution for future long range secure communications

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Network-wide Quantum Key Distribution with Onion Routing Relay

    cs.CR 2025-05 conditional novelty 4.0 of 10

    Onion Routing Relay applies post-quantum layered encryption to quantum key distribution relays, hiding the shared key from intermediate nodes with only a small increase in end-to-end delivery time.

  2. Network-wide Quantum Key Distribution with Onion Routing Relay (Conference Version)

    cs.CR 2025-05 conditional novelty 4.0 of 10

    A simulation study finds that onion-routing key relay in QKD networks adds modest overhead to key distribution, while the authenticated variant is significantly slower.

Pith tools