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

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

11 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 publicationIEEE International Symposium on Information Theory - Proceedings
Pages936-940
Number of pages5
DOIs
Publication statusPublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice
Duration: 2007 Jun 242007 Jun 29

Other

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

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

An algorithm for computing the secrecy capacity of broadcast channels with confidential messages. / Yasui, Kensuke; Suko, Tota; Matsushima, Toshiyasu.

IEEE International Symposium on Information Theory - Proceedings. 2007. p. 936-940 4557344.

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

Yasui, K, Suko, T & Matsushima, T 2007, An algorithm for computing the secrecy capacity of broadcast channels with confidential messages. in IEEE International Symposium on Information Theory - Proceedings., 4557344, pp. 936-940, 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, 07/6/24. https://doi.org/10.1109/ISIT.2007.4557344
Yasui K, Suko T, Matsushima T. An algorithm for computing the secrecy capacity of broadcast channels with confidential messages. In IEEE International Symposium on Information Theory - Proceedings. 2007. p. 936-940. 4557344 https://doi.org/10.1109/ISIT.2007.4557344
Yasui, Kensuke ; Suko, Tota ; Matsushima, Toshiyasu. / An algorithm for computing the secrecy capacity of broadcast channels with confidential messages. IEEE International Symposium on Information Theory - Proceedings. 2007. pp. 936-940
@inproceedings{913e9bdf2dfa4833993000b761cdd365,
title = "An algorithm for computing the secrecy capacity of broadcast channels with confidential messages",
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.",
author = "Kensuke Yasui and Tota Suko and Toshiyasu Matsushima",
year = "2007",
doi = "10.1109/ISIT.2007.4557344",
language = "English",
isbn = "1424414296",
pages = "936--940",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

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

AU - Yasui, Kensuke

AU - Suko, Tota

AU - Matsushima, Toshiyasu

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51649118624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51649118624&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2007.4557344

DO - 10.1109/ISIT.2007.4557344

M3 - Conference contribution

SN - 1424414296

SN - 9781424414291

SP - 936

EP - 940

BT - IEEE International Symposium on Information Theory - Proceedings

ER -