Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 65, Issue 7, Pages 4069-4093Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2019.2904500
Keywords
Finite blocklength; information-theoretic security; privacy amplification; semantic security; wiretap channel
Funding
- U.S. National Science Foundation [CCF-093970, CCF-1513915]
- German Research Foundation (DFG) [WY 151/2-1]
Ask authors/readers for more resources
This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the classic privacy amplification results, but also achieve secrecy under the stronger semantic-security metric.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available