Finite-Length Analysis of Wiretap Codes using Universal Hash Functions
Abstract: This paper investigates the relation between the second-order coding rate, where the second-order turns out to be strictly larger than $\sqrt{n}$, and the mutual information as the leaked information for a fixed error probability by using wiretap codes constructed by universal$_2$ hash functions. We first generalize the upper bound on $\epsilon$-smooth max information in \cite{tyagi} and use it in our analysis where we adopt the method in \cite{hayashi-tan}, which uses universal hashing for compressing a source and making it secure from another correlated source, and apply it to the wiretap channel. We prove first- and second-order achievability results by assuming that the conjecture we state holds true.
- H. Tyagi and A. Vardy, “Universal hashing for information theoretic security,” arXiv:1412.4958, 2016. [Online]. Available: https://arxiv.org/abs/1412.4958
- M. Hayashi and V. Y. F. Tan, “Equivocations, exponents, and second-order coding rates under various rényi information measures,” IEEE Transactions on Information Theory, vol. 63, no. 2, pp. 975–1005, 2017.
- A. D. Wyner, “The wire-tap channel,” The Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1387, 1975.
- I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 339–348, 1978.
- W. Yang, R. F. Schaefer, and H. V. Poor, “Wiretap channels: Nonasymptotic fundamental limits,” IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4069–4093, 2019.
- M. H. Yassaee, M. R. Aref, and A. Gohari, “Non-asymptotic output statistics of random binning and its applications,” in 2013 IEEE International Symposium on Information Theory, 2013, pp. 1849–1853.
- M. Hayashi, “Exponential decreasing rate of leaked information in universal random privacy amplification,” IEEE Transactions on Information Theory, vol. 57, no. 6, pp. 3989–4001, 2011.
- M. Wiese and H. Boche, “Semantic security via seeded modular coding schemes and ramanujan graphs,” IEEE Transactions on Information Theory, vol. 67, no. 1, pp. 52–80, 2021.
- Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307–2359, 2010.
- V. Y. F. Tan, “Asymptotic estimates in information theory with non-vanishing error probabilities,” Foundations and Trends® in Communications and Information Theory, vol. 11, no. 1-2, pp. 1–184, 2014. [Online]. Available: http://dx.doi.org/10.1561/0100000086
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.