From LINC

Downloads
PDF

This paper appeared in the proceedings for ITW 2007.

Abstract

This paper studies the secrecy capacity in a semi-deterministic setting -- where the channel between legitimate users (called Alice and Bob) is deterministic, while that between Alice and the eavesdropper (called Eve) is any other discrete memoryless channel. Such a model is particularly relevant when a pre-existing error correcting code tailored to the legitimate channel is in use on top of which secret information is to be shared.

First, this paper considers a point to point setting with a single wire-tapper, where wire-tap secrecy capacity has an elegant characterization. Next, a generalized multiple access setting with confidential messages is considered where each user wishes to communicate secret information to a common destination without the other determining its message. Here, the paper obtains outer-bounds on secrecy capacity.

Citation

Jared Grubb, Sriram Vishwanath, Yinbing Liang, and H. Vincent Poor . "Secrecy Capacity for Semi-deterministic Wire-tap Channels."

BibTeX

@inproceedings{ {{{bitex cite}}},
  author = "Jared Grubb and Sriram Vishwanath and Yinbing Liang and H. Vincent Poor",
  title = { Secrecy Capacity for Semi-deterministic Wire-tap Channels },
  booktitle = {  }
}