An algorithm for computing the secrecy capacity of broadcast channels with confidential messages

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

12 Citations (Scopus)

Abstract

In this paper, we present an iterative algorithm for computing the secrecy capacity of broadcast channel with confidential message (BCC) in the situation that the main channel is less noisy than the eavesdropper's channel. The global convergence of the algorithm is proved, and an expression for its convergence rate is derived.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages936-940
Number of pages5
DOIs
Publication statusPublished - 2007 Dec 1
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 2007 Jun 242007 Jun 29

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
CountryFrance
CityNice
Period07/6/2407/6/29

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Yasui, K., Suko, T., & Matsushima, T. (2007). An algorithm for computing the secrecy capacity of broadcast channels with confidential messages. In Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007 (pp. 936-940). [4557344] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2007.4557344