Pith. sign in

REVIEW

Classical - Quantum Arbitrarily Varying Wiretap Channel: Common Randomness Assisted Code and Continuity

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 1606.01768 v2 pith:R6NYVFBE submitted 2016-06-06 cs.IT math.ITquant-ph

classification cs.ITmath.ITquant-ph
keywords arbitrarilychannelsecrecyassistedcapacitycommondeterminerandomness
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels.Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender to the legal receiver and varies arbitrarily from the sender to the eavesdropper. As an application we examine when the secrecy capacity is a continuous function of the system parameters and show that resources, i.e., having access to a perfect copy of the outcome of a random experiment. are helpful for channel stability.

Discussion (0). Sign in to comment.

Pith tools