2000 character limit reached
Secrecy Coding for the Binary Symmetric Wiretap Channel via Linear Programming
Published 13 Jan 2024 in cs.IT and math.IT | (2401.07141v1)
Abstract: In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation for a wiretap channel where the main channel is noiseless, and the wiretap channel is a binary symmetric channel (BSC). Using this technique, we present an analytical limit for the achievable secrecy rate in the finite blocklength regime that is tighter than traditional fundamental limits. We also propose a secrecy coding technique that outperforms random binning codes. When there is one overhead bit, this coding technique is optimum and achieves the analytical limit. For cases with additional bits of overhead, our coding scheme can achieve equivocation rates close to the new limit. Furthermore, we evaluate the patterns of the generator matrix and the parity-check matrix for linear codes and we present binning techniques for both linear and non-linear codes using two different approaches: recursive and non-recursive. To our knowledge, this is the first optimization solution for secrecy coding obtained through linear programming.
- C. E. Shannon, “A mathematical theory of communication,” The Bell Sys. Tech. J., 1948.
- ——, “Communication theory of secrecy systems,” The Bell Sys. Tech. J., 1949.
- A. D. Wyner, “The wire-tap channel,” Bell Sys. Tech. J., 1975.
- I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE T. Inf. Theory, 1978.
- S. Leung-Yan-Cheong and M. Hellman, “The Gaussian wire-tap channel,” IEEE T. Inf. Theory, 1978.
- M. Shoushtari and W. Harrison, “Secrecy coding in the integrated network enhanced telemetry (iNET),” in ITC, 2021.
- H.-M. Wang, Q. Yang, Z. Ding, and H. V. Poor, “Secure short-packet communications for mission-critical IoT applications,” IEEE T. on Wireless Comm., 2019.
- W. K. Harrison and M. Shoushtari, “On caching with finite blocklength coding for secrecy over the binary erasure wiretap channel,” in WTS, 2021.
- M. Shoushtari, F. Arabian, and W. K. Harrison, “Post-quantum cryptography based on codes: A game changer for secrecy in aeronautical mobile telemetry,” in ITC, 2022.
- M. Shoushtari and W. K. Harrison, “New dual relationships for error-correcting wiretap codes,” in IEEE ITW, 2021.
- M. Shirvanimoghaddam, M. S. Mohammadi, R. Abbas, A. Minja, C. Yue, B. Matuz, G. Han, Z. Lin, W. Liu, Y. Li, S. Johnson, and B. Vucetic, “Short block-length codes for ultra-reliable low latency communications,” IEEE Comm. Mag., 2019.
- M. Shoushtari and W. Harrison, “Optimizing finite-blocklength nested linear secrecy codes: Using the worst code to find the best code,” Entropy, 2023.
- W. K. Harrison, J. Almeida, M. R. Bloch, S. W. McLaughlin, and J. Barros, “Coding for secrecy: An overview of error-control coding techniques for physical-layer security,” IEEE Signal Processing Mag., 2013.
- M. Bloch, M. Hayashi, and A. Thangaraj, “Error-control coding for physical-layer secrecy,” Proc. of the IEEE, 2015.
- A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J. Merolla, “Applications of LDPC codes to the wiretap channel,” IEEE T. Inf. Theory, 2007.
- A. Subramanian, A. Thangaraj, M. Bloch, and S. W. McLaughlin, “Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes,” IEEE T. on Inf. Forensics and Security, 2011.
- G. Yang and M. Zhuang, “Achieving the secrecy capacity on strong security using LT code with polar code pre-coding,” in IEEE ASID, 2016.
- M. Shakiba-Herfeh, L. Luzzi, and A. Chorti, “Finite blocklength secrecy analysis of polar and Reed-Muller codes in BEC semi-deterministic wiretap channels,” in IEEE ITW, 2021.
- M. Andersson, V. Rathi, R. Thobaben, J. Kliewer, and M. Skoglund, “Nested polar codes for wiretap and relay channels,” IEEE Comm. Letters, 2010.
- E. Hof and S. Shamai, “Secrecy-achieving polar-coding,” in IEEE ITW, 2010.
- H. Mahdavifar and A. Vardy, “Achieving the secrecy capacity of wiretap channels using polar codes,” IEEE T. Inf. Theory, 2011.
- Y. Chen and A. J. Vinck, “On the binary symmetric wiretap channel,” in IZS, 2010.
- S. Al-Hassan, M. Z. Ahmed, and M. Tomlinson, “Secrecy coding for the wiretap channel using best known linear codes,” in GIIS, 2013.
- J. Pfister, M. Gomes, J. P. Vilela, and W. K. Harrison, “Quantifying equivocation for finite blocklength wiretap codes,” in IEEE ICC, 2017.
- V. Rana and R. A. Chou, “Short blocklength wiretap channel codes via deep learning: Design and performance evaluation,” IEEE T. on Comm., 2023.
- W. K. Harrison and M. R. Bloch, “On dual relationships of secrecy codes,” in Allerton, 2018.
- Y. Dong and S. Yang, “On optimal finite-length binary codes of four codewords for binary symmetric channels,” in ISITA, 2020.
- M. A. M. Sayed, R. Liu, and C. Zhang, “A novel scrambler design for enhancing secrecy transmission based on polar code,” IEEE Comm. Letters, 2017.
- C. M. Stuart and P. P. Deepthi, “Nonlinear cryptosystem based on QC-LDPC codes for enhanced security and reliability with low hardware complexity and reduced key size,” Wireless Personal Comm., 2017.
- W. Yang, R. F. Schaefer, and H. V. Poor, “Wiretap channels: Nonasymptotic fundamental limits,” IEEE T. Inf. Theory, 2019.
- Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE T. Inf. Theory, 2010.
- W. Yang, R. F. Schaefer, and H. V. Poor, “Secrecy-reliability tradeoff for semi-deterministic wiretap channels at finite blocklength,” in IEEE ISIT, 2017.
- A. T. Suresh, A. Subramanian, A. Thangaraj, M. Bloch, and S. McLaughlin, “Strong secrecy for erasure wiretap channels,” in IEEE ITW, 2010.
- B. Jensen, B. Clark, D. Flanary, K. Norman, M. Rice, and W. K. Harrison, “Physical-layer security: Does it work in a real environment?” in IEEE ICC, 2019.
- J. Pfister, “Finite blocklength secrecy coding,” Master’s Thesis, University of Colorado Colorado Springs, 2018.
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.