Wiretap Channels: Nonasymptotic Fundamental Limits

Wei Yang, Rafael F. Schaefer, H. Vincent Poor

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

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.

Original languageEnglish (US)
Article number8665906
Pages (from-to)4069-4093
Number of pages25
JournalIEEE Transactions on Information Theory
Volume65
Issue number7
DOIs
StatePublished - Jul 2019

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Finite blocklength
  • information-theoretic security
  • privacy amplification
  • semantic security
  • wiretap channel

Fingerprint Dive into the research topics of 'Wiretap Channels: Nonasymptotic Fundamental Limits'. Together they form a unique fingerprint.

  • Cite this