Secrecy capacity of semi-deterministic wire-tap channels

Jared Grubb, Sriram Vishwanath, Yingbin Liang, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

This paper studies secrecy capacity in a semi-deterministic setting, in which the channel between legitimate users (called Alice and Bob) is deterministic, while that between Alice and the eavesdropper (called Eve) is a 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, a point-to-point setting is considered with a single wire-tapper, a situation in which the secrecy capacity has an elegant characterization. Next, a generalized multiple access setting with confidential messages is considered in which each user wishes to communicate secret information to a common destination without the other determining its message. In this latter situation, outer bounds on the secrecy capacity are obtained.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW
Pages199-202
Number of pages4
DOIs
StatePublished - 2007
Event2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW - Solstrand, Norway
Duration: Jul 1 2007Jul 6 2007

Publication series

NameProceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW

Other

Other2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, ITW
Country/TerritoryNorway
CitySolstrand
Period7/1/077/6/07

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems
  • Communication

Fingerprint

Dive into the research topics of 'Secrecy capacity of semi-deterministic wire-tap channels'. Together they form a unique fingerprint.

Cite this