Pith. Sign in

RECORD

The Security of Quantum Key Distribution using a Simplified Trusted Relay

Quantum Physics · Submitted 19 Aug 2014

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Our protocol shifts the communication and computational weight of classical post-processing to the end users by reassigning the roles of error correction and privacy amplification, while leaving the exchange of quantum signals untouched.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1408.4426 (version 1)
Pith IDWX4244KD, Pith's permanent record of this paper and its review
CitationNorbert L\"utkenhaus, Razieh Annabestani, William Stacey, Xiongfeng Ma. "The Security of Quantum Key Distribution using a Simplified Trusted Relay." arXiv:1408.4426 (2014). https://pith.science/paper/WX4244KD
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,917 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.21 · human participants 0.04 · controlled comparison 0.09 · randomized assignment 0.02 · states quantitative result 0.06 · compares with prior results 0.14 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We propose a QKD protocol for trusted node relays. Our protocol shifts the communication and computational weight of classical post-processing to the end users by reassigning the roles of error correction and privacy amplification, while leaving the exchange of quantum signals untouched. We perform a security analysis for this protocol based on the BB84 protocol on the level of infinite key formulas, taking into account weak coherent implementations involving decoy analysis.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We propose a QKD protocol for trusted node relays. contribution 1.00 0.84 0.14 asserted 0.98
s1 Our protocol shifts the communication and computational weight of classical post-processing to the end users by reassigning the roles of error correction and privacy amplification, while leaving the exchange of quantum signals untouched. method 0.58 0.80 0.20 asserted 1.00
s2 We perform a security analysis for this protocol based on the BB84 protocol on the level of infinite key formulas, taking into account weak coherent implementations involving decoy analysis. method 0.73 0.92 0.12 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.95 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We propose a QKD protocol for trusted node relays. Our protocol shifts the communication and computational weight of classical post-processing to the end users by reassigning the roles of error correction and privacy amplification, while leaving the exchange of quantum signals untouched. We perform a security analysis for this protocol based on the BB84 protocol on the level of infinite key formulas, taking into account weak coherent implementations involving decoy analysis.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.