A New Wiretap Channel Model and Its Strong Secrecy Capacity

DOI10.1109/TIT.2017.2786541zbMATH Open1390.94866arXiv1701.07007OpenAlexW2775838555MaRDI QIDQ4566764FDOQ4566764

Authors: Mohamed Nafea, Aylin Yener 

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword symbols of her choosing. Additionally, she observes the remainder of the transmitted symbols through a discrete memoryless channel. This new model subsumes the classical wiretap channel and wiretap channel II with noisy main channel as its special cases. The strong secrecy capacity of the proposed channel model is identified. Achievability is established by solving a dual secret key agreement problem in the source model, and converting the solution to the original channel model using probability distribution approximation arguments. In the dual problem, a source encoder and decoder, who observe random sequences independent and identically distributed according to the input and output distributions of the legitimate channel in the original problem, communicate a confidential key over a public error-free channel using a single forward transmission, in the presence of a compound wiretapping source who has perfect access to the public discussion. The security of the key is guaranteed for the exponentially many possibilities of the subset chosen at wiretapper by deriving a lemma which provides a doubly-exponential convergence rate for the probability that, for a fixed choice of the subset, the key is uniform and independent from the public discussion and the wiretapping source's observation. The converse is derived by using Sanov's theorem to upper bound the secrecy capacity of the new wiretap channel model by the secrecy capacity when the tapped subset is randomly chosen by nature.

Full work available at URL: https://arxiv.org/abs/1701.07007

Recommendations

• Generalizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy
• Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component
• The Secrecy Capacity of Cost-Constrained Wiretap Channels
• The Secrecy Capacity of the MIMO Wiretap Channel
• Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints
• A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel
• Secrecy results for compound wiretap channels
• Information Security
• The Secrecy Capacity of Compound Gaussian MIMO Wiretap Channels
• Strong Secrecy for Wireless Channels (Invited Talk)

Mathematics Subject Classification ID

Source coding (94A29) Authentication, digital signatures and secret sharing (94A62)

Cited In (2)

• On message protection in cryptosystems modelled as the generalized wire-tap channel II
• The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation

This page was built for publication: A New Wiretap Channel Model and Its Strong Secrecy Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566764)