| Presentation | 2014-03-11 Coding Theorems for Shannon's Cipher System under Two New Secrecy Criteria Shun KIKUCHI, Hiroki KOGA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper we consider the situation where n plaintexts generated from a stationary memoryless source are encoded to a cryptogram under a key that is shared by an encoder and a decoder in advance. We introduce three kinds of criteria on the secrecy of plaintexts and investigate respective achievable rate regions on the rates of the ciphertext and the key. The first criterion requires that the maximum success probability of guessing the plaintext given the cryptogram is lower-bounded by a given constant in average. In the second and the third criteria we consider a list decoder of a wiretapper for obtaining candidates of the plaintext given the cryptogram with probability close to one and require two respective properties on the size of the outputs of the list decoder. It is shown that under the above three criteria the achievable rate regions coincide with the achievable rate region under the ordinary criterion using the conditional entropy of the plaintext given the cryptogram. We also discuss relationships between the criteria under a certain assumption. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Information-theoretic secrecy / Shannon's cipher system / guessing secrecy / list decoder |
| Paper # | IT2013-95,ISEC2013-124,WBS2013-84 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2014/3/3(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 | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Coding Theorems for Shannon's Cipher System under Two New Secrecy Criteria |
| Sub Title (in English) | |
| Keyword(1) | Information-theoretic secrecy |
| Keyword(2) | Shannon's cipher system |
| Keyword(3) | guessing secrecy |
| Keyword(4) | list decoder |
| 1st Author's Name | Shun KIKUCHI |
| 1st Author's Affiliation | Graduate school of Systems and Information Engineering, University of Tsukuba() |
| 2nd Author's Name | Hiroki KOGA |
| 2nd Author's Affiliation | Graduate school of Systems and Information Engineering, University of Tsukuba |
| Date | 2014-03-11 |
| Paper # | IT2013-95,ISEC2013-124,WBS2013-84 |
| Volume (vol) | vol.113 |
| Number (no) | 484 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |