Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Topology-Hiding Connectivity-Assurance for QKD Inter-Networking

Margherita Cozzolino, Stephan Krenn, Thomas Lorünser

Abstract

While QKD ensures information-theoretic security at the link level, real-world deployments depend on trusted repeaters, creating potential vulnerabilities. In this paper, we thus introduce a topology-hiding connectivity assurance protocol to enhance trust in quantum key distribution (QKD) network infrastructures. Our protocol allows network providers to jointly prove the existence of a secure connection between endpoints without revealing internal topology details. By extending graph-signature techniques to support multi-graphs and hidden endpoints, we enable zero-knowledge proofs of connectivity that ensure both soundness and topology hiding. We further discuss how our approach can certify, e.g., multiple disjoint paths, supporting multi-path QKD scenarios. This work bridges cryptographic assurance methods with the operational requirements of QKD networks, promoting verifiable and privacy-preserving inter-network connectivity.

Topology-Hiding Connectivity-Assurance for QKD Inter-Networking

Abstract

While QKD ensures information-theoretic security at the link level, real-world deployments depend on trusted repeaters, creating potential vulnerabilities. In this paper, we thus introduce a topology-hiding connectivity assurance protocol to enhance trust in quantum key distribution (QKD) network infrastructures. Our protocol allows network providers to jointly prove the existence of a secure connection between endpoints without revealing internal topology details. By extending graph-signature techniques to support multi-graphs and hidden endpoints, we enable zero-knowledge proofs of connectivity that ensure both soundness and topology hiding. We further discuss how our approach can certify, e.g., multiple disjoint paths, supporting multi-path QKD scenarios. This work bridges cryptographic assurance methods with the operational requirements of QKD networks, promoting verifiable and privacy-preserving inter-network connectivity.

Paper Structure

This paper contains 23 sections, 15 equations, 4 figures, 1 table.

Table of Contents

  1. Introduction
  2. Motivation
  3. Related work
  4. Contribution and Technical Overview
  5. Preliminaries
  6. Cryptographic Definitions
  7. Pedersen Commitment
  8. Zero-Knowledge Notation
  9. Multigraph MoniPoly Encoding
  10. Multigraph MoniPoly Commitment
  11. Camenisch-Lysyanskaya SDH Signature Scheme
  12. Signature Scheme on Committed Multigraph
  13. A Blackbox Construction
  14. Phase 1
  15. Phase 2
  16. ...and 8 more sections

Figures (4)

  • Figure 1: Users are able to obtain cryptographic assurance about inter-network path availability without revealing the underlying network topology.
  • Figure 2:
  • Figure 3: Summary of Phase 1
  • Figure 4: Summary of Phase 2

Theorems & Definitions (4)

  • Definition 1: cryptoeprint:2020/1403
  • Definition 2: cryptoeprint:2020/1403
  • Definition 3
  • Definition 4