Evidence map›Paper›PMID 42352206›Full record

ArticleEntropy (Basel, Switzerland)2026

Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks.

Krišjānis Petručeņa, Sergejs Kozlovičs, Juris Vīksna, Elīna Kalniņa, Reinis Isaks, Edgars Celms, Lelde Lāce, Edgars Rencis

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

8 authors.

Krišjānis PetručeņaInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0009-0008-5713-5914
Sergejs KozlovičsInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0000-0002-7085-383X
Juris VīksnaInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0000-0003-2283-2978
Elīna KalniņaInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0009-0004-2680-3220
Reinis IsaksInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0009-0001-3784-208X
Edgars CelmsInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0000-0001-9608-3792
Lelde LāceInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0000-0001-7650-2355
Edgars RencisInstitute of Mathematics and Computer Science, University of Latvia, LV-1459 Riga, Latvia.ORCID 0000-0002-1606-4944

Funding

European Union 2.3.1.1.i.0/1/22/I/CFLA/001
6 · The paper itself

Abstract

Quantum key distribution (QKD) networks require relaying when distant key management entities share no direct quantum link. Most relay strategies, however, rely on centralized control or globally maintained routing state. This paper asks whether useful security and efficiency can still be obtained with topology-oblivious stochastic forwarding. It studies the security-overhead trade-off in a model in which fragmented key material is relayed via random-walk variants and reconstructed under privacy amplification. The analysis asks whether strictly local forwarding can retain useful information-theoretic security (ITS). Evaluation on the GÉANT topology, representing a European academic backbone network, shows clear differences between random-walk variants. The proposed highest-score-neighbor local path-diversification heuristic reduces the probability that relayed key material passes through a compromised node. The evaluation also shows that scouting-based loop erasure significantly shortens sampled routes and improves throughput in the model. Against one- to three-node cartels, random flow protects slightly more source-target pairs than a static disjoint-multipath method on the evaluated topologies. These findings position topology-oblivious stochastic forwarding as a simpler decentralized design for QKD relaying without centralized orchestration or gossip protocols.

Indexed as

privacy amplificationQKD networksquantum key distributionrandom walkstopology-oblivious routingtrusted-node relaying

Identifiers

PMID42352206
PMCPMC13297652

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.