PRINCIPLES OF CHOOSING CONTAINERS FOR STEGANOGRAPHIC SYSTEMS
In this study, the general principles of choosing containers to create perfect steganographic systems, as well as the characteristics, types, volume, size, format, stability of containers against attacks are considered. The process of entering information into a container is described, and the stability of steganograms with respect to passive and active attacks is analyzed. The distinguishing aspects of the formats of modern graphic containers, the advantage and disadvantages of the Internet protocols TCP, IP, VoIP and SCTP which are used as containers are discussed. To determine the effect of containers on steganographic stability, a theoretical information model of steganographic system with a passive intruder has been suggested. The dependence of the stability of steganographic systems on the technology of introducing hidden messages into a container is explained and the probability distributions of containers and steganograms are analyzed. It was shown that the stability of steganographic systems depends on the probability distributions of containers and steganograms, and only in the case they are identically distributed, the steganographic system is completely stable.
PRINCIPLES OF CHOOSING CONTAINERS FOR STEGANOGRAPHIC SYSTEMS
In this study, the general principles of choosing containers to create perfect steganographic systems, as well as the characteristics, types, volume, size, format, stability of containers against attacks are considered. The process of entering information into a container is described, and the stability of steganograms with respect to passive and active attacks is analyzed. The distinguishing aspects of the formats of modern graphic containers, the advantage and disadvantages of the Internet protocols TCP, IP, VoIP and SCTP which are used as containers are discussed. To determine the effect of containers on steganographic stability, a theoretical information model of steganographic system with a passive intruder has been suggested. The dependence of the stability of steganographic systems on the technology of introducing hidden messages into a container is explained and the probability distributions of containers and steganograms are analyzed. It was shown that the stability of steganographic systems depends on the probability distributions of containers and steganograms, and only in the case they are identically distributed, the steganographic system is completely stable.
___
- 1. Аграновский, А.В. и Балакин, А.В. и Грибунин, В.Г. и Сапожников, С.А., Стеганография, цифровые водяные знаки и стеганоанализ, М.: Вузовская книга, 220 с., 2009.
- 2. Грибунин, В.Г. и Оков, И.Н. и Туринцев, И.В., Цифровая стеганография, М.: Солон-Пресс, 272 c., 2002.
- 3. Конахович, Г.Ф. и Пузыренко, А.Ю., Компьютерная стеганография. Теория и практика, К.: МК-Пресс, 288 c., 2006.
- 4. Bender, W. and Gruhl, D. and Morimoto, N. and Lu, A., Techniques for Data Hiding, IBM Systems Journal, Vol. 35, P. 313–336, 1996.
- 5. Enrique, C. and Roberto, G. and Ryouske, W., Data Hiding in Identification and Offset IP fields, California University at Irwing, Computer Science and Engineering 204B University of California, Irvine, CA 92717 USA. http://www.sciweavers.org/read/data-hiding-in-identification-and-offset-ip-fields-124683
- 6. Пескова, О.Ю. и Халабурда, Г.Ю., Применение сетевой стеганографии для защиты данных, передаваемых по открытым каналам Интернет, Известия ЮФУ. Технические науки, Вып. 12, С. 348-354, 2012.
- 7. Касумов В.А. и Гусейнова, Г.Возможности создания передачи каналы cкрытой информации в протоколах интернет, Journal of Qafqaz University, Mathematics and Computer Science, Vol. 3, No. 1, P. 50-56, 2015.
- 8. Stewart, R., Ed. Stream Control Transmission Protocol. RFC 4960. Request for Comments: 4960, http://tools.ietf.org/html/rfc4960, 2007.
- 9. Cachin, C., An Information-Theoretic Model for Steganography, Proceeding of 2nd Int. Workshop on Information Hiding, Vol. 1525, P. 306-3018, 1998.
- 10. Чиcар, И. и Кернер, Я. Теория информации: Теоремы кодирования для дискретных систем без памяти, Пер. с англ., М.: Мир, 400 с., 1985.