Pith. sign in

REVIEW 1 cited by

Anonymous conference key agreement in linear quantum 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 2205.09169 v2 pith:I4ZQQFVS submitted 2022-05-18 quant-ph cs.CR

classification quant-phcs.CR
keywords quantumpartiesnodesprotocolagreementanonymouscommunicationconference
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA), an extension of key distribution to multiple parties, has received much attention recently. Interestingly, CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity. In this work, we propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting. Specifically, a line of quantum repeater nodes is used to build a linear cluster state among all nodes, which is then used to anonymously establish a secret key between any three of them. The nodes need only share maximally entangled pairs with their neighbours, therefore avoiding the necessity of a central server sharing entangled states. This repeater setup makes our protocol an excellent candidate for implementation in future quantum networks. We explicitly prove that our protocol protects the identities of the participants from one another and perform an analysis of the key rate in the finite regime, contributing to the quest of identifying feasible quantum communication tasks for network architectures beyond point-to-point.

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. The Structure of Circle Graph States

    quant-ph 2026-03 unverdicted novelty 7.0 of 10

    Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.

Pith tools