New bounds on the imbalance of a half-l-sequence

Wang, Qichun; Tan, Chik How

doi:10.1109/isit.2015.7282944

Cited by 3 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analysis in the remark following the proof of Theorem 2 in the Supplementary Note 3 provides insight into the relationship between the maximum quantum-secure covert communication throughput, the system parameters (reliability and detectability) and channel parameters (noise power level and transmissivity). However, establishing the exact relationship, as was done for classical covert communication 13 14 , would yield the equivalent of the channel capacity in standard reliable communication and enable characterization of the structured receivers that attain this maximum.…”

Section: Discussionmentioning

confidence: 99%

“…Shannon capacity is thus inadequate for characterizing the limits of covert communication over the AWGN channel, and we developed new techniques to prove this square-root law (SRL). Since then, alternative techniques and insights, as well as further refinements to the SRL, have been found 13 14 . Even though the asymptotic rate of covert communication is zero (as ), a non-trivial burst of covert bits can be transmitted when n is large.…”

mentioning

confidence: 99%

“…Even though the asymptotic rate of covert communication is zero (as ), a non-trivial burst of covert bits can be transmitted when n is large. Our work was generalized to other classical channel settings 13 14 15 16 17 18 . Similar SRLs were also found in steganography, where it was shown that Alice can modify symbols in a cover text of size n , embedding hidden bits 9 19 20 21 22 23 .…”

mentioning

confidence: 99%

See 2 more Smart Citations

Quantum-secure covert communication on bosonic channels

et al. 2015

View full text Add to dashboard Cite

Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth—that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary—for example, thermal noise from blackbody radiation—the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.

show abstract

Section: Discussionmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Quantum-secure covert communication on bosonic channels

et al. 2015

View full text Add to dashboard Cite

show abstract

“…[8] and later in Ref. [9–11]. We showed that the half‐ ℓ ‐sequences have ideal arithmetic correlations when p ≡ 1 (mod 8) and obtained an upper bound for p ≡ −1 (mod 8).…”

Section: Conclusion and Further Issuesmentioning

confidence: 74%

“…[8] and the statistical properties in Ref. [9,10]. The classical auto-correlations were investigated in Ref.…”

Section: Introductionmentioning

confidence: 99%

Arithmetic correlation of binary half‐ℓ‐sequences

Chen

Edemskiy

Niu

et al. 2022

IET Information Security

View full text Add to dashboard Cite

The arithmetic correlations of two binary half‐ℓ‐sequences with connection integer pr, which is an odd prime power, are investigated. Possible values (of the arithmetic correlation) are calculated. In particular, if p ≡ 1 (mod 8), the authors prove that they are zero for non‐trivial shifts, that is, the half‐ℓ‐sequences have ideal arithmetic correlations. If p ≡ −1 (mod 8), an upper bound, which is of order of magnitude pr−1/2 ln p, is derived by using earlier results on the imbalance of half‐ℓ‐sequences with connection integer p studied by Gu and Klapper and later improved by Wang and Tan.

show abstract