Presentation 2005-03-18
On Coding Theorems for a General Wiretap Channel
Hiroki KOGA, Naoki SATO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper is concerned with coding theorems for a generalized wiretap channel. In the problem of the wiretap channel it is crucial to characterize the secrecy capacity, i.e., the maximum achievable rate of information securely transmitted from a sender to a receiver in the presence of a wiretapper. In our model channels are not restricted to memoryless channels. In fact, channels can be any discrete channels. We first define the secrecy capacity C_s and characterize C_s from the information-spectrum approach. We give a new upper bound of C_s and explore conditions under which the obtained upper bound coincides with a known lower bound [5]. We also discuss coding theorems on the generalized wiretap channel under a weakened criterion on secrecy.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Wiretap channel / coding theorem / general channel / information-spectrum
Paper # IT2004-74,ISEC2004-130,WBS2004-189
Date of Issue

Conference Information
Committee ISEC
Conference Date 2005/3/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Coding Theorems for a General Wiretap Channel
Sub Title (in English)
Keyword(1) Wiretap channel
Keyword(2) coding theorem
Keyword(3) general channel
Keyword(4) information-spectrum
1st Author's Name Hiroki KOGA
1st Author's Affiliation Graduate School of Systems and Information Engineering, University of Tsukuba()
2nd Author's Name Naoki SATO
2nd Author's Affiliation Master's Program in Science and Engineering, University of Tsukuba
Date 2005-03-18
Paper # IT2004-74,ISEC2004-130,WBS2004-189
Volume (vol) vol.104
Number (no) 732
Page pp.pp.-
#Pages 6
Date of Issue