Pith. sign in

REVIEW 1 cited by

Whispering Secrets in a Crowd: Leveraging Non-Covert Users for Covert Communications

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 2408.12962 v1 pith:FYOZLUNV submitted 2024-08-23 cs.IT math.IT

classification cs.ITmath.IT
keywords userscovertratesnon-covertsecret-keyachievablefundamentalbudgets
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper establishes the fundamental limits of a multi-access system where multiple users communicate to a legitimate receiver in presence of an external warden. Only a specific subset of the users, called covert users, needs their communication to remain undetected to the warden, while the remaining non-covert users have no such constraint. The fundamental limits show a tradeoff between the different rates that are simultaneously achievable at the various users in function of the secret-key rates that the different users share with the legitimate receiver. Interestingly, the presence of the non-covert users can enhance the capacities of the covert users, especially under stringent secret-key budgets. Our findings underscore the essential requirement of employing a multiplexing (coded time-sharing) strategy to exhaust the fundamental region of all rates that are simultaneously achievable at the covert and the non-covert users. As a side-product of our results, we also establish the covert-capacity secret-key tradeoff for standard single-user and multi-access covert communication systems (without non-covert users), i.e., the largest covert rates that are achievable under given secret-key rate budgets. Previous works had only established the minimum secret-key rates required at largest covert rates.

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. Full citation record

  1. Square-Root Law for Covert Communication with Warden-Favorable Side Information

    cs.IT 2026-07 accept novelty 5.0 of 10

    For covert communication with a warden who cancels a known public component, the maximum covert payload is (σ_0²/(σ_B² ln 2))√(nδ) bits over n uses, with σ_0² including Willie's post-cancellation residual noise.

Pith tools