Information Technology Reference
In-Depth Information
changes, thus minimizing the detectability of the hidden messages. As a
result, security is improved compared to schemes with the public selection
channel because the embedded areas remain unavailable to both the recipi-
ent and any illegitimate attacker.
References
1. G. J. Simmons. 1984, August. The prisoners' problem and the subliminal
channel. Proceedings of CRYPTO 83: Advances in Cryptology, Santa Barbara,
CA, 51-67.
2. C. Cachin. 1998, April. An information-theoretic model for steganography.
Proceedings of the Second International Workshop on Information Hiding,
Lecture Notes in Computer Science, vol. 1525, 306-18.
3. A. Westfeld and R. Böhme. 2004, May. Exploiting preserved statistics for ste-
ganalysis. Proceedings of the 6th International Workshop on Information
Hiding, Lecture Notes in Computer Science, vol. 3200, Toronto, Canada, 82-96.
4. A. V. Kuznetsov and B. S. Tsybakov. 1974. Coding in a memory with defective
cells.
Problemy Peredachi Informatsii
10 (2): 52-60.
5. J. Fridrich, M. Goljan, P. Lisonˇk, and D. Soukal. 2005, October. Writing on wet
paper.
IEEE Transactions on Signal Processing
53 (10): 3923-35.
6. S. I. Gel'fand and M. S. Pinsker. 1980. Coding for channel with random param-
eters.
Problems of Control and Information Theory
9 (1): 19-31.
7. C. Heegard and A. El Gamal. 1983, September. On the capacity of computer
memory with defects.
IEEE Transactions on Information Theory
29 (5): 731-39.
8. M. van Dijk and F. Willems. 2001, May. Embedding information in grayscale
images. Proceedings of 22nd Symposium on Information and Communication
Theory in the Benelux, Enschede, The Netherlands, 147-54.
9. J. Fridrich, P. Lisonˇk, and D. Soukal. 2007, July. On steganographic embed-
ding efficiency. Proceedings of the 8th International Workshop on Information
Hiding, Lecture Notes in Computer Science, vol. 4437, Alexandria, VA, 282-96.
10. H. C. Du and J. S. Sobolewski. 1982, March. Disk allocation for Cartesian prod-
uct files on multiple-disk systems.
ACM Transactions on Database Systems
7
(1):
82-101.
11. C. Y. Chen, H. F. Lin, C. C. Chang, and R. C. T. Lee. 1997. Optimal bucket alloca-
tion design of k-ary MKH files for partial match retrieval.
IEEE Transactions on
Knowledge and Data Engineering
9
(1): 148-60.
12. J. Fridrich and D. Soukal. 2006, September. Matrix embedding for large pay-
loads.
IEEE Transactions on Information Forensics and Security
1
(3): 390-95.
13. F. M. J. Willems and M. van Dijk. 2005, March. Capacity and codes for embed-
ding information in gray-scale signals.
IEEE Transactions on Information Theory
51
(3): 1209-14.
