Pith. sign in

REVIEW 3 major objections 4 minor 42 references

Covert Communication over Physically-Degraded Alarm Two-Way Channels

T0 review · 3 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For physically-degraded alarm two-way channels, the paper proves an exact covert capacity region in which secret coordination strictly enlarges what public time-sharing can achieve, with coordination overhead vanishing asymptotically.

desk verdict First covert capacity region for two-way channels, with a genuinely new sparse time-sharing mechanism, but the converse contains a repairable gap in Lemma 6.13. read the letter →

arxiv 2506.16581 v1 pith:5JQ3UPX3 submitted 2025-06-19 cs.IT math.IT

Tuna Erdoğan , Tyler Kann , Aria Nosratinia , Matthieu Bloch This is my paper · ORCID
classification cs.ITmath.IT MSC 94A1594A40
keywords covertcommunicationstwo-waychannelsalarmsquarerootlawchannelresolvabilitycapacityregionblockMarkovcodinglowprobabilityofdetection
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper characterizes how much information two users can exchange covertly over a two-way channel in which simultaneous transmissions trigger an alarm at the eavesdropper. It proves that for physically-degraded alarm two-way channels the covert capacity region is the union over $\lambda\in[0,1]$ of the throughput pairs bounded by $r_1\le \lambda c_\lambda D(P_{10}^{(2)}\|P_{00}^{(2)})$ and $r_2\le \bar\lambda c_\lambda D(P_{01}^{(1)}\|P_{00}^{(1)})$, where $c_\lambda=\sqrt{2/\chi^2(\lambda Q_{10}+\bar\lambda Q_{01}\|Q_{00})}$. This region is strictly larger than the public time-sharing region, so secret coordination genuinely improves covert throughput. The coordination itself is generated from the covert traffic, which is why the paper finds that the coordination cost comes asymptotically for free.

What carries the argument

The load-bearing object is the sparse time-sharing auxiliary random variable $U$, with $P_U(0)=1-(q_1+q_2)n^{-1/4}$, $P_U(1)=q_1n^{-1/4}$, $P_U(2)=q_2n^{-1/4}$, and conditional codeword distributions scaled by $n^{-1/4}$. This distribution makes the eavesdropper's induced output differ from $Q_{00}$ at order $n^{-1/2}$, while $I(U;Z)$ decays only as $n^{-3/4}$: fast enough for the resolvability-style concentration arguments to work, but not so fast that the random-coding bounds become trivial. The auxiliary variable indicates which user is allowed to deviate from the innocent symbol, and it is carried across blocks by block-Markov chaining: the secret parts of both users' messages decoded in block $b$ become the common coordination message in block $b+1$. That chaining is the mechanism behind the asymptotic freeness of coordination.

What would settle it

Construct a binary alarm two-way code that places all non-innocent inputs in the first $n^{3/4}$ coordinates, each with non-innocent probability $n^{-1/4}$, tuned so the eavesdropper's total relative entropy stays at $\delta$. If such a code achieves throughputs outside the region of Theorem 5.2, the uniform per-symbol vanishing assumption in Lemma 6.13 fails; if no such code can, the converse's uniformity condition is not the load-bearing gap.

Watch

Extended reading notes

Core claim

The central claim is Theorem 5.2: for a binary-input physically-degraded alarm two-way channel, the covert capacity region is exactly the union over $\lambda\in[0,1]$ of the sets of throughput pairs satisfying the two inequalities with the common factor $c_\lambda=\sqrt{2/\chi^2(\lambda Q_{10}+\bar\lambda Q_{01}\|Q_{00})}$. The factor $c_\lambda$ captures how the total covertness budget is split between the two users' non-innocent symbols, while $\lambda$ and $\bar\lambda$ split the blocklength between the two directions. Achievability is shown by a block-Markov coding scheme with sparse time-sharing, and the matching converse is obtained by specializing a general outer bound for arbitrary discrete memoryless two-way channels to the alarm structure, where covertness forces $\rho_{11}=0$. The paper also observes that the physical-degradation inequalities are not needed for the achievability of this region, so a user who individually has no channel advantage over the eavesdropper can still communicate covertly with the partner's help.

Load-bearing premise

The converse's per-symbol analysis assumes every coordinate's non-innocent probability vanishes uniformly, while the covertness constraint only forces this on average over coordinates; a code that concentrates non-innocent symbols in a few coordinates could escape the bound.

Editorial extensions

If this is right

  • The covert capacity region $C$ is strictly larger than the public time-sharing region $C_{\mathrm{PTS}}$ for the same alarm channel, so secret coordination is not just a convenience but a genuine throughput gain.
  • A user with no individual relative-entropy advantage over the eavesdropper can still achieve positive covert throughput, because the partner's coordinated activity helps hide the transmission.
  • The coordination message size grows only as $O(n^{1/4})$ in the exponent, whereas message throughput grows as $O(\sqrt{n})$, so the coordination overhead vanishes asymptotically relative to the covert payload.
  • The general converse Proposition 6.10 provides a single-letter outer bound for any discrete memoryless two-way channel, and it is tight for physically-degraded alarm channels after imposing $\rho_{11}=0$.
  • The alarm-channel analysis shows that the square-root law persists under coordination, with the exact throughput governed by a chi-square divergence of the mixture $\lambda Q_{10}+\bar\lambda Q_{01}$ against $Q_{00}$.
  • The paper's own analysis leaves open whether the full two-way covert capacity for non-alarm or non-degraded channels is also governed by a similar ratio-symmetric chi-square trade-off; the general converse is not tight in those cases.
  • A testable extension suggested by the proof is a code that concentrates all non-innocent inputs in a vanishing fraction of coordinates: if such a code can satisfy the average covertness constraint while exceeding Theorem 5.2, the uniform per-symbol vanishing assumption in the converse would be the reason the outer bound is not fully general.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper studies covert communication over binary-input discrete memoryless two-way channels in which simultaneous non-innocent transmissions by both users trigger an alarm at the eavesdropper. It defines a covert throughput region with the usual sqrt(n) normalization and then proves two main results for physically-degraded alarm two-way channels: Theorem 5.1 characterizes the covert capacity region under public time sharing, and Theorem 5.2 characterizes the full covert capacity region as a union over a time-sharing parameter lambda of bounds involving the chi-square divergence of the eavesdropper mixture and the relative entropies of the legitimate channel outputs. The achievability proof uses a sparse time-sharing distribution with an auxiliary random variable whose probability scales as n^{-1/4}, together with a block-Markov scheme in which secret message parts generated in one block serve as coordination information for the next block. The converse is a specialization of a general outer bound for arbitrary discrete memoryless two-way channels. The paper also claims that the coordination overhead vanishes asymptotically and that cooperation strictly enlarges the public time-sharing region.

Significance. If the technical gaps identified below are closed, this is a valuable contribution to multi-user covert communications. The main result provides the first covert capacity region for a nontrivial two-way channel model and identifies a concrete mechanism by which user cooperation strictly improves covert throughputs while the coordination cost vanishes asymptotically. The paper's analytical strengths include explicit scaling analyses for the auxiliary random variables, a detailed block-Markov achievability scheme, a general converse bound that is of independent interest, and a numerical illustration of the capacity region. The claimed result is falsifiable and the proof is largely self-contained, building on established resolvability and covert-communication tools rather than introducing ad hoc assumptions. The main reservations concern three load-bearing points in the proofs: an unjustified per-symbol weight assumption in the converse, an algebraic inconsistency in the public time-sharing proof, and an omitted proof of a key chaining lemma.

major comments (3)
  1. [VI-C, Lemma 6.13 and Appendix H] The hypothesis of Lemma 6.13 that the per-symbol non-innocent probabilities mu_{kl}^{(n,i)} vanish uniformly in i is not implied by the covertness constraint D(bQ^n||Q00^n) <= delta; that constraint only forces the time-averaged weight mu_n to be O(1/sqrt(n)). In Appendix H, the Taylor expansion around equations (198)-(200) produces an error O((mu_{10}^{(n,i)})^2), and this is replaced in (206) by O(n(mu_{10}^n)^2) with the time-averaged weight. This replacement is not justified: by Cauchy's inequality one has sum_i (mu_i)^2 >= n (mu_bar)^2, so the stated n(mu_bar)^2 can underestimate the true quadratic error when non-innocent mass is concentrated in a few coordinates. Since Lemma 6.13 is used to derive the outer bound (75) and hence Theorem 5.2, the converse as written has a gap. The gap appears repairable: equation (69) gives sum_i D(bQ_i^n||Q00) <= delta, and for alarm channels D(bQ_i||Q00) is bounded below by a positive constant times (mu_{10,i}^2 + mu_{01,i}^2), so sum_i mu_i^2 = O(1); writing the error as O(sum_i mu_i^2) instead of O(n(mu_bar)^2) would preserve the conclusion. The authors should either prove the uniform vanishing hypothesis or replace it with this L2 control.
  2. [VI-A, Propositions 6.1 and 6.2, Eq. (32), Lemma 6.3] There is a blocklength error in the public time-sharing derivation. User 2 transmits during the second sub-block of length lambdabar n, not lambda n, but the denominators in Propositions 6.1 and 6.2 and in Eq. (32) use sqrt(lambda n (delta - delta_1)) for User 2. With the displayed (32), substituting delta_1 = lambda delta gives r2 <= sqrt(lambda(1-lambda)) times the anticipated constant, not (1-lambda) times it as claimed in Theorem 5.1. The same wrong factor appears in the Lagrangian in Lemma 6.3. The proof of Theorem 5.1 is therefore algebraically inconsistent unless the lambda in the second sub-block is corrected to lambdabar throughout; after that correction, the substitution delta_1 = lambda delta yields the stated region.
  3. [VI-B, Lemma 6.8] Lemma 6.8 is load-bearing for the achievability proof: it converts per-block resolvability and reliability guarantees into a bound on the total relative entropy D(bQ^{nB}||Q00^{nB}) across the chained blocks, including the effect of estimation errors of the secret messages. The proof is omitted with the note that it is similar to [37]. Given that the present scheme has a two-way block-Markov structure and a different covert process, this is not a purely notational adaptation. The authors should provide the proof or state precisely which result in [37] applies and how the two-way coupling and the estimates of the secret messages are handled.
minor comments (4)
  1. [Proposition 6.5] The displayed inequalities for r2 use lambda instead of lambdabar: the second and fourth displayed bounds should read (1-mu)c_lambda lambdabar D(P_{01}^{(1)}||P_{00}^{(1)}) and (1+mu)c_lambda lambdabar D(Q01||Q00), consistent with equations (60) and (61).
  2. [Eq. (63)] The term D(Q01||P_{00}^{(2)}) should be D(Q01||Q00); the current notation appears to be a typo.
  3. [End of Section VI-C] The specialization of the converse to alarm channels states r2 <= c_lambda lambdabar D(P_{10}^{(2)}||P_{00}^{(2)}); the last factor should be D(P_{01}^{(1)}||P_{00}^{(1)}).
  4. [Lemma 6.13 statement] The mutual information in the sum is written as I(X_{1i};Y_{2i}|X_{1i}); it should be I(X_{1i};Y_{2i}|X_{2i}).

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the capacity region is derived from explicit channel assumptions, with prior and self-cited results used only as technical tools.

full rationale

The paper's central derivation is self-contained against its stated channel model. Theorem 5.2 is proved by an achievability construction based on sparse time-sharing with an auxiliary random variable and a converse based on a general outer bound, both developed in the paper's own appendices. The cited prior works are used as tools rather than as the target claim: [4] supplies the point-to-point covert channel achievability and converse, [37] inspires the block-Markov coding structure, and [22] is mentioned only as an illustrative mechanism, not as a load-bearing premise. The final region is expressed in channel-dependent divergences and chi-square distances, and the covertness budget is normalized out of the throughput definition, so the result is not equivalent to a fitted or renamed input. The apparent gap in Lemma 6.13 concerning uniform per-symbol vanishing of non-innocent weights is a correctness concern, not a circularity: even if the lemma's proof needs an L2 control obtained from equation (69), the conclusion is not identical to the covertness constraint or to any assumed region. No parameter is fitted to data and then renamed as a prediction, and no uniqueness theorem is imported from the authors' prior work to force the answer. Therefore, the appropriate circularity score is 0.

Assumptions & free parameters 3 free parameters · 6 assumptions · 0 invented entities

The central claim rests on the channel model assumptions (alarm, physical degradation, absolute continuity) and on standard information-theoretic inequalities. The free parameters q1,q2,p1,p2 are internal to the achievability proof and do not affect the final region after optimization over lambda. No new physical entities are postulated.

free parameters (3)
  • p1, p2, q1, q2
    Design parameters in the sparse time-sharing distribution (15). They set the non-innocent symbol probabilities and the mixture weight lambda, and are chosen to satisfy the covertness constraint (59). They are internal coding parameters, not fitted to external data.
  • lambda
    Union parameter in the capacity region, equal to q1p1/(q1p1+q2p2). The region is the union over all lambda in [0,1].
  • mu
    Slack parameter in the achievable rate bounds; can be made arbitrarily small. It is not a physical parameter.
assumptions (6)
  • domain assumption The channel is a discrete memoryless two-way channel with binary inputs and finite output alphabets, and the kernel W_{Y1Y2Z|X1X2} is known to all parties.
    Used throughout Sections III-VI as the model.
  • domain assumption Q00 cannot be written as a convex combination of {Q01, Q10}, and Qij, (i,j) not equal (1,1), is absolutely continuous with respect to Q00.
    Stated after Remark 3.3; without these assumptions the square root law can be circumvented or covert communication becomes impossible.
  • domain assumption Alarm two-way channel: there exists an alert symbol * with Q11(*)>0 and Qij(*)=0 for (i,j) not equal (1,1).
    Definition 3.1; this is the model under study.
  • domain assumption Physically-degraded conditions: D(P10^(2)||P00^(2)) > D(Q10||Q00) and D(P01^(1)||P00^(1)) > D(Q01||Q00).
    Definition 3.2; used to guarantee positive throughput under public time-sharing and in Lemma 6.3. The authors note the terminology is nonstandard.
  • standard math Standard information-theoretic tools: relative entropy properties, Pinsker's inequality, log-sum inequality, Bernstein's inequality, and the Euler-Lagrange equation.
    Used in the appendices; these are standard results.
  • domain assumption The block Markov scheme assumes the existence of a common secret message W0^(b) that both users share at the start of each block, generated from prior secret messages.
    This is the coordination mechanism; the paper shows its rate vanishes asymptotically.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Covert Communication over Physically-Degraded Alarm Two-Way Channels." pith.science (2026). https://pith.science/paper/5JQ3UPX3

@misc{pith2026250616581,
  author       = {Pith},
  title        = {Pith review of: Covert Communication over Physically-Degraded Alarm Two-Way Channels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5JQ3UPX3}},
  note         = {Machine review of arXiv:2506.16581}
}
read the original abstract

We study covert communications over binary-input discrete memoryless alarm two-way channels, in which two users interact through a two-way channel and attempt to hide the presence of their communication from an eavesdropping receiver. The alarm two-way channel is one in which simultaneous transmissions by both users trigger an alarm at the eavesdropper, which captures the challenges and opportunities of cooperation beyond interference management. In particular, by characterizing the covert capacity region of two-way channels when using public time sharing, we show how cooperation strictly improves achievable covert communication throughputs. While our analysis falls short of characterizing the two-way covert capacity region for all two-way channels, we provide general achievable and converse bounds that illuminate the cooperation mechanisms that benefit covertness and are tight for a physically-degraded alarm two-way channels. Because of the unique nature of covert communications, our analysis also shows that the coordination required to avoid triggering alarms comes asymptotically "for free". The key technical challenge that we address is how to appropriately design auxiliary random variables in a multi-user covert communication setting subject to the square root law.

Figures

Figures reproduced from arXiv: 2506.16581 by the authors.

Figure 1
Figure 1. Two-way covert communication model. We consider the communication model illustrated in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Comparison of the public time-sharing covert capacity region [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Functional dependence graph of the proposed coding scheme. In every block [PITH_FULL_IMAGE:figures/full_fig_p015_3.png] view at source ↗

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

42 extracted references · 39 canonical work pages

  1. [37]

    Cooperative resolvability and secrecy in the cribbing multiple-access channel,

    N. Helal, M. Bloch, and A. Nosratinia, “Cooperative resolvability and secrecy in the cribbing multiple-access channel,” IEEE Transactions on Information Theory , vol. 66, no. 9, pp. 5429–5447, Sep. 2020

    work page 2020

  2. [1]

    Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications

    J. Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications . Cambridge University Press, Nov. 2009

    work page 2009

  3. [2]

    Limits of reliable communication with low probability of detection on AWGN channels,

    B. Bash, D. Goeckel, and D. Towsley, “Limits of reliable communication with low probability of detection on AWGN channels,” IEEE Journal on Selected Areas in Communications , vol. 31, no. 9, pp. 1921–1930, Sep. 2013

    work page 1921

  4. [3]

    Fundamental limits of communication with low probability of detection,

    L. Wang, G. W. Wornell, and L. Zheng, “Fundamental limits of communication with low probability of detection,” IEEE Transactions on Information Theory , vol. 62, no. 6, pp. 3493–3503, Jun. 2016

    2016

  5. [4]

    Covert communication over noisy channels: A resolvability perspective,

    M. R. Bloch, “Covert communication over noisy channels: A resolvability perspective,” IEEE Transactions on Information Theory, vol. 62, no. 5, pp. 2334–2354, May 2016

    2016

  6. [5]

    First and second order asymptotics in covert communication,

    M. Tahmasbi and M. R. Bloch, “First and second order asymptotics in covert communication,” IEEE Transactions on Information Theory, vol. 65, no. 4, pp. 2190 –2212, Apr. 2019

    work page 2019

  7. [6]

    Optimal throughput for covert communication over a classical-quantum channel,

    L. Wang, “Optimal throughput for covert communication over a classical-quantum channel,” in Proc. of IEEE Information Theory Workshop, Cambridge, UK, Sep. 2016, pp. 364–368

    work page 2016

  8. [7]

    Covert communication over classical-quantum channels,

    A. Sheikholeslami, B. A. Bash, D. Towsley, D. Goeckel, and S. Guha, “Covert communication over classical-quantum channels,” in Proc. of IEEE International Symposium on Information Theory , Barcelona, Spain, Jul. 2016, pp. 2064–2068. 23

    work page 2016

Show all 42 references
  1. [8]

    Fundamental limits of covert communication over classical-quantum channels,

    M. S. Bullock, A. Sheikholeslami, M. Tahmasbi, R. C. Macdonald, S. Guha, and B. A. Bash, “Fundamental limits of covert communication over classical-quantum channels,” IEEE Transactions on Information Theory , vol. 71, no. 4, pp. 2741–2762, Apr. 2025

    2025

  2. [9]

    Fundamental limits of quantum-secure covert communication over bosonic channels,

    M. S. Bullock, C. N. Gagatsos, S. Guha, and B. A. Bash, “Fundamental limits of quantum-secure covert communication over bosonic channels,” IEEE Journal of Selected Areas in Communications , vol. 38, no. 3, pp. 471–482, Mar. 2020

    2020

  3. [10]

    Covert capacity of bosonic channels,

    C. N. Gagatsos, M. S. Bullock, and B. A. Bash, “Covert capacity of bosonic channels,” IEEE Journal on Selected Areas in Information Theory , vol. 1, no. 2, pp. 555–567, Aug. 2020

    2020

  4. [11]

    Towards a characterization of the covert capacity of bosonic channels under trace distance,

    S.-Y . Wang, T. Erdo˘gan, and M. R. Bloch, “Towards a characterization of the covert capacity of bosonic channels under trace distance,” in Proc. of IEEE International Symposium on Information Theory , Helsinki, Finland, Jun. 2022, pp. 354–359

    2022

  5. [12]

    Resource-efficient entanglement-assisted covert communications over bosonic channels,

    S.-Y . Wang, S.-J. Su, and M. R. Bloch, “Resource-efficient entanglement-assisted covert communications over bosonic channels,” in Proc. of IEEE International Symposium on Information Theory , Athens, Greece, Jul. 2024, pp. 3106–3111

    2024

  6. [13]

    Covert communication over a k-user multiple access channel,

    K. S. K. Arumugam and M. R. Bloch, “Covert communication over a k-user multiple access channel,” IEEE Transactions on Information Theory , vol. 65, no. 11, pp. 7020–7044, Nov. 2019

    2019

  7. [14]

    Covert communication over gaussian multiple-access channels with feedback,

    K.-H. Cho and S.-H. Lee, “Covert communication over gaussian multiple-access channels with feedback,” IEEE Wireless Communications Letters, vol. 11, no. 9, pp. 1985–1989, Sep. 2022

    1985

  8. [15]

    Mixing a covert and a non-covert user,

    A. Bounhar, M. Sarkiss, and M. Wigger, “Mixing a covert and a non-covert user,” in Proc. of IEEE International Symposium on Information Theory , Taipei, Taiwan, Jun. 2023, pp. 2577–2582

    2023

  9. [16]

    Whispering secrets in a crowd: Leveraging non-covert users for covert communications,

    ——, “Whispering secrets in a crowd: Leveraging non-covert users for covert communications,” 2024. [Online]. Available: https://arxiv.org/abs/2408.12962

    2024 arXiv

  10. [17]

    Treating interference as noise is optimal for covert communication over interference channels,

    K.-H. Cho and S.-H. Lee, “Treating interference as noise is optimal for covert communication over interference channels,” IEEE Transactions on Information Forensics and Security , vol. 16, pp. 322–332, Jul. 2021

    2021

  11. [18]

    Embedding covert information in broadcast communications,

    K. S. K. Arumugam and M. R. Bloch, “Embedding covert information in broadcast communications,” IEEE Transactions on Information Forensics and Security , vol. 14, no. 10, pp. 2787–2801, Oct. 2019

    2019

  12. [19]

    Embedding covert information on a given broadcast code,

    D. Kibloff, S. M. Perlaza, and L. Wang, “Embedding covert information on a given broadcast code,” in Proc. of IEEE International Symposium on Information Theory , Paris, France, Jul. 2019, pp. 2169–2173

    2019

  13. [20]

    Time-division is optimal for covert communication over some broadcast channels,

    V . Y . F. Tan and S.-H. Lee, “Time-division is optimal for covert communication over some broadcast channels,” IEEE Transactions on Information Forensics and Security , vol. 14, no. 5, pp. 1377–1389, May 2019

    2019

  14. [21]

    Covert communication with channel-state information at the transmitter,

    S. H. Lee, L. Wang, A. Khisti, and G. W. Wornell, “Covert communication with channel-state information at the transmitter,” IEEE Transactions on Information Forensics and Security , vol. 13, no. 9, pp. 2310–2319, Sep. 2018

    2018

  15. [22]

    Keyless covert communication via channel state information,

    H. Zivari-Fard, M. Bloch, and A. Nosratinia, “Keyless covert communication via channel state information,” IEEE Transactions on Information Theory , vol. 68, no. 8, Aug. 2022

    2022

  16. [23]

    Covert communication in the presence of an uninformed jammer,

    T. V . Sobers, B. A. Bash, S. Guha, D. Towsley, and D. Goeckel, “Covert communication in the presence of an uninformed jammer,” IEEE Transactions on Wireless Communications , vol. 16, no. 9, pp. 6193–6206, Jun. 2017

    2017

  17. [24]

    Effective secrecy: Reliability, confusion and stealth,

    J. Hou and G. Kramer, “Effective secrecy: Reliability, confusion and stealth,” in 2014 IEEE International Symposium on Information Theory, 2014, pp. 601–605

    2014

  18. [25]

    Effective secrecy: Reliability, confusion and stealth,

    ——, “Effective secrecy: Reliability, confusion and stealth,” in Proc. of IEEE International Symposium on Information Theory, Honolulu, HI, July 2014, pp. 601–605

    2014

  19. [26]

    Covert secret key generation,

    M. Tahmasbi and M. R. Bloch, “Covert secret key generation,” in Proc. of IEEE Conference on Communications and Network Security, Workshop on Physical-Layer Methods for Wireless Security , Las Vegas, NV , Oct. 2017, pp. 540–544

    2017

  20. [27]

    Framework for covert and secret key expansion over classical-quantum channels,

    ——, “Framework for covert and secret key expansion over classical-quantum channels,” Physical Review A , vol. 99, p. 052329, May 2019. 24

    2019

  21. [28]

    Covert and secret key expansion over quantum channels under collective attacks,

    ——, “Covert and secret key expansion over quantum channels under collective attacks,” IEEE Transactions on Information Theory, vol. 66, no. 11, pp. 7113–7131, Nov. 2020

    2020

  22. [29]

    Stealthy secret key generation,

    P.-H. Lin, C. R. Janda, E. A. Jorswieck, and R. F. Schaefer, “Stealthy secret key generation,” Entropy, vol. 22, no. 6, p. 679, Jun. 2020

    2020

  23. [30]

    Two-way communication channels,

    C. E. Shannon, “Two-way communication channels,” in Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics , vol. 4. University of California Press, 1961, pp. 611–645

    1961

  24. [31]

    Capacity of two-way channels with symmetry properties,

    J.-J. Weng, L. Song, F. Alajaji, and T. Linder, “Capacity of two-way channels with symmetry properties,” IEEE Transactions on Information Theory , vol. 65, no. 10, pp. 6290–6313, Oct. 2019

    2019

  25. [32]

    The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming,

    E. Tekin and A. Yener, “The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming,” IEEE Transactions on Information Theory , vol. 54, no. 6, pp. 2735–2751, Jun. 2008

    2008

  26. [33]

    Correction to: “the Gaussian multiple access wire-tap channel

    ——, “Correction to: “the Gaussian multiple access wire-tap channel” and “the general Gaussian multiple access and two- way wire-tap channels: Achievable rates and cooperative jamming”,” IEEE Transactions on Information Theory , vol. 56, no. 9, pp. 4762–4763, Sep. 2010

    2010

  27. [34]

    Strongly secure communications over the two-way wiretap channel,

    A. J. Pierrot and M. R. Bloch, “Strongly secure communications over the two-way wiretap channel,” IEEE Transactions on Information Forensics and Security , vol. 6, no. 3, pp. 595–605, Sep. 2011

    2011

  28. [35]

    Achievable secrecy rate regions for the two-way wiretap channel,

    A. El Gamal, O. O. Koyluoglu, M. Youssef, and H. E. Gamal, “Achievable secrecy rate regions for the two-way wiretap channel,” IEEE Transactions on Information Theory , vol. 59, no. 12, pp. 8099–8114, Dec. 2013

    2013

  29. [36]

    The role of feedback in two-way secure communications,

    X. He and A. Yener, “The role of feedback in two-way secure communications,” IEEE Transactions on Information Theory, vol. 59, no. 12, pp. 8115–8130, Dec. 2013

    2013

  30. [38]

    El Gamal and Y .-H

    A. El Gamal and Y .-H. Kim, Network Information Theory . Cambridge University Press, 2011

    2011

  31. [39]

    Gelfand and S

    I. Gelfand and S. Fomin, Calculus of Variations, ser. Dover Books on Mathematics. Dover Publications, 2012

    2012

  32. [40]

    General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channels,

    M. Hayashi, “General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channels,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1562–1575, April 2006

    2006

  33. [41]

    Strong secrecy from channel resolvability,

    M. R. Bloch and J. N. Laneman, “Strong secrecy from channel resolvability,” IEEE Transactions on Information Theory , vol. 59, no. 12, pp. 8077–8098, Dec. 2013. APPENDIX A PROOF OF LEMMA 4.1 For the Time-Sharing joint distribution defined in (5) and (7), QZ =Q00 +qp1n− 1 2 (Q1...

    2013

  34. [42]

    + 1 Mp 2M0 P⊗n Z|X2U(zn|xn 2,un) + 1 Mp 1M0 P⊗n Z|X1U(zn|xn 1,un) + 1 M0 P⊗n Z|U(zn|un) +Q⊗n Z (zn) (150) (a) ⩽ n log 1 (1−n−1(q1p1 +q2p2))νmin + log 5 (151) ⩽n log 5 (1−n−1(q1p1 +q2p2))νmin , (152) where (a) follows from upper bounding the terms in the second log by 1 and usi...

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.