 |
Technical Program
Paper Detail
| Paper: | MA-L4.8 |
| Session: | Steganography and Steganalysis |
| Time: | Monday, October 9, 12:20 - 12:40 |
| Presentation: |
Lecture
|
| Title: |
PROVABLY SECURE STEGANOGRAPHY: ACHIEVING ZERO K-L DIVERGENCE USING STATISTICAL RESTORATION |
| Authors: |
Kaushal Solanki; Mayachitra, Inc. | | | | | Kenneth Sullivan; Mayachitra, Inc. | | | | | Upamanyu Madhow; University of California, Santa Barbara | | | | | B. S. Manjunath; University of California, Santa Barbara | | | | | Shivkumar Chandrasekaran; University of California, Santa Barbara | | |
| Abstract: |
In this paper, we present a framework for the design of steganographic schemes that can provide provable security by achieving zero Kullback-Leibler divergence between the cover and the stego signal distributions, while hiding at high rates. The approach is to reserve a number of host symbols for statistical restoration: host statistics perturbed by data embedding are restored by suitably modifying the symbols from the reserved set. A dynamic embedding approach is proposed, which avoids hiding in low probability regions of the host distribution. The framework is applied to design practical schemes for image steganography, which are evaluated using supervised learning on a set of about 1000 natural images. For the presented JPEG steganography scheme, it is seen that the detector is indeed reduced to random guessing. |
|
