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

Kensuke Yasui; Tota Suko; Toshiyasu Matsushima

doi:10.1109/ISIT.2007.4557344

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

Kensuke Yasui, Tota Suko, Toshiyasu Matsushima

School of Social Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	IEEE International Symposium on Information Theory - Proceedings
Pages	936-940
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2007.4557344
Publication status	Published - 2007
Event	2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice Duration: 2007 Jun 24 → 2007 Jun 29

Other

Other	2007 IEEE International Symposium on Information Theory, ISIT 2007
City	Nice
Period	07/6/24 → 07/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

@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",

note = "2007 IEEE International Symposium on Information Theory, ISIT 2007 ; Conference date: 24-06-2007 Through 29-06-2007",

}

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

AN - SCOPUS:51649118624

SN - 1424414296

SN - 9781424414291

SP - 936

EP - 940

BT - IEEE International Symposium on Information Theory - Proceedings

T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007

Y2 - 24 June 2007 through 29 June 2007

ER -

Access to Document

10.1109/ISIT.2007.4557344