| Presentation | 1999/7/23 Safety-Provable Steganography Shin Natori, Hiroshi Imai, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper we first extend the steganography system model which Cachin proposed so as to admit errors. Based on this model, we introduce a new perfectly secure steganography scheme, one-time hash steganography, with which one can hide a secret bit into any cover-message that satisfies certain condition (partial recomputability). Finally, with the existence of one-time hash steganography system, we show that there exists a perfectly secure steganography system with given cover-message if and only if the cover-message source is partially recomputable to its sender. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | steganography / information hiding |
| Paper # | ISEC99-34 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 1999/7/23(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) | Safety-Provable Steganography |
| Sub Title (in English) | |
| Keyword(1) | steganography |
| Keyword(2) | information hiding |
| 1st Author's Name | Shin Natori |
| 1st Author's Affiliation | Department of Information Science, University of Tokyo() |
| 2nd Author's Name | Hiroshi Imai |
| 2nd Author's Affiliation | Department of Information Science, University of Tokyo |
| Date | 1999/7/23 |
| Paper # | ISEC99-34 |
| Volume (vol) | vol.99 |
| Number (no) | 209 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |