Pith. sign in

REVIEW 1 cited by

Advantage of multi-partite entanglement for quantum cryptography over long and short ranged 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 2312.13376 v3 pith:YQMO5FU2 submitted 2023-12-20 quant-ph

classification quant-ph
keywords advantagemulti-partitenetworksquantumentanglementsecurityattackscryptography
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The increasing sophistication of available quantum networks has seen a corresponding growth in the pursuit of multi-partite cryptographic protocols. Whilst the use of multi-partite entanglement is known to offer an advantage in certain abstractly motivated contexts, the quest to find practical advantage scenarios is ongoing and substantial difficulties in generalising some bi-partite security proofs still remain. We present rigorous results that address both these challenges at the same time. First, we prove the security of a variant of the GHZ state based secret sharing protocol against general attacks, including participant attacks which break the security of the original GHZ state scheme. We then identify parameters for a performance advantage over realistic bottleneck networks. We show that whilst channel losses limit the advantage region to short distances over direct transmission networks, the addition of quantum repeaters unlocks the performance advantage of multi-partite entanglement over point-to-point approaches for long distance quantum cryptography.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Strategy optimization for quantum conference key agreement in asymmetric star networks

    quant-ph 2026-05 unverdicted novelty 4.0 of 10

    Numerical simulations show that optimizing cutoff times is critical for maintaining performance of GHZ-based conference key agreement in asymmetric star quantum networks under variations in party count, memories, and ...

Pith tools