Sensitivity analysis of singular vectors of cover matrix as basis of steganography algorithm, that steady to lossy compression

Authors

  • Алла Анатоліївна Кобозєва Одеський національний політехнічний університет
  • Маргарита Олександрівна Мельник Одеський національний політехнічний університет

DOI:

https://doi.org/10.18372/2410-7840.15.4767

Keywords:

singular vector, singular value, sensitivity, perturbation, lossy compression, matrix

Abstract

The problem of creating steganography algorithm, that steady to lossy compression with significant ratios remains unsolved to date, although lossy compression is one of the most common attacks on stegano messages. Traditional approach in this field is using frequency domain container, while ensuring the reliability of perception formed stegano message, guaranteed to provide resistance to compression of steganography algorithms only with minor coefficients. In the frequency domain is fundamentally impossible to solve the problem. Early has shown that the properties of any steganography algorithm determined by the localization of disturbances occurred during stegano transformation, formal parameters that make up a complete set - singular values and singular vectors of a matrix container. This paper covers the analysis of image’s singular vectors sensitivity to compression, selected the least sensitive vectors. It is shown that the left and right singular vectors corresponding to the maximum singular values are sign-insensitive. They are close to the optimal n-vector of R8-space with any disturbances. These results are the basis for steganographic techniques and algorithms that are resistant to compression with large coefficients

Author Biographies

Алла Анатоліївна Кобозєва, Одеський національний політехнічний університет

Professor, Doctor of Science in Eng., Head of Academic Department of Computer Science and Information security management systems Odessa National Polytechnic University.

Маргарита Олександрівна Мельник, Одеський національний політехнічний університет

a senior lecturer of information security department Odessa National Polytechnic University

References

Аграновский А.В. Стеганография, цифровые водяные знаки и стеганоанализ / А.В.Аграновский, А.В.Балакин, В.Г.Грибунин, С.А.Сапожников. – М.: Вузовская книга, 2009. – 220 с.

Конахович Г.Ф., Пузыренко А.Ю. Компьютерная стеганография. Теория и практика. – К.: МК – Пресс, 2006.

Кобозєва А.А. Аналіз захищеності інформаційних систем / А.А.Кобозєва, І.О.Мачалін, В.О.Хорошко. – К.: Вид. ДУІКТ, 2010. – 316 с.

Прохожев Н.Н. Влияние внешних воздействий на DC-коэффициент матрицы дискретно-косинусного преобразования в полутоновых изображениях / Н.Н.Прохожев, О.В.Михайличенко, А.Г.Коробейников // Научно-технический вестник Санкт-Петербургского государственного университета информационных технологий, механики и оптики. – 2008. – № 56. – С. 57-62.

Шумейко А.А. Использование квантования Ллойда-Макса для внедрения цифровых водяных знаков / А.А.Шумейко, А.И.Пасько, Т.Н. Тищенко // Інформаційна безпека. – 2010. – № 2. – С. 101-107.

Кобозева А.А. Анализ информационной безопасности / А.А.Кобозева, В.А.Хорошко. – К.: Изд.ГУИКТ, 2009. – 251 с.

Кобозева А.А. Связь свойств стеганографического алгоритма и используемой им области контейнера для погружения секретной информации / А.А.Кобозева // Искусственный интеллект. – 2007. – №4. – С.531-538.

Мельник М.А. Стеганоалгоритм, устойчивый к сжатию / М.А.Мельник // Інформаційна безпека. – 2012. – №2(8). – С.99-106.

Гантмахер Ф.Р. Теория матриц / Ф.Р.Гантмахер. – М.: Наука, 1988. – 552 с.

Кобозева А.А. Векторная SIGN-чувствительность как основа геометрической модели системы защиты информации / А.А.Кобозева, В.А.Хорошко // Захист інформації. – 2008. – №3. – С. 49-57.

Advanced Statistical Steganalisis / R. Bohme, Springer, 2010.

Agranovsky, A. et al (2009), Steganography, Digital Watermarks and Steganalysis. Moscow: Vuzovskaya kniga.

Konakhovich, G. and Puzyrenko, A. (2006), Computer Steganography. Theory and Practice. Kyiv: MK-Press.

Kobozeva, A., Machalin, I. and Khoroshko, V. (2010), Analysis of Information Systems Protection. Kyiv: DUIKT.

Böhme, R. (2010), Advanced Statistical Steganalysis. Springer-Verlag, Berlin Heidelberg.

Prokhozhev, N., Mikhailichenko, O. and Korobeynikov, A. (2008), “External attacks effect on DC coefficients of DCT matrix of still semitone images”, Scientific and Technical Journal of Information Technologies, Mechanics and Optics, No. 56, pp. 57-62.

Shumeiko, A., Pasko, A. and Tishchenko, T. (2008) Use quantization Lloyd-Max the implementation of digital watermark. Information Security, No. 2(4), pp. 101-107.

Kobozeva, A. and Khoroshko, V. (2009), Analysis of Information Security. Kyiv: DUIKT.

Kobozeva, A. (2007), “Communication properties steganographic algorithm, and used them to immersion of the container of classified information”, Artificial Intelligence, No. 4, pp. 531-538.

Melnyk, M. (2012), “Compressive-stable SteganoAlgorithm”, Information Security, No. 2(8), pp. 99-106.

Gantmacher, F. (1988), The Theory of Matrices. Moscow: Nauka.

Kobozeva, A. and Khoroshko, V. (2008), “Vector SIGN-sensitivity as basis of geometry model of information security system”, Information Security, No. 3, pp. 49-57.

Downloads

Published

2013-06-15

Issue

Vol. 15 No. 2 (2013)

Section

Articles

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).