<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-68</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>АЛГОРИТМ МАРКИРОВАНИЯ ИЗОБРАЖЕНИЙ НА ОСНОВЕ ВИЗУАЛЬНОЙ КРИПТОГРАФИИ ДЛЯ ЗАЩИТЫ ОТ НЕСАНКЦИОНИРОВАННОГО РАСПРОСТРАНЕНИЯ ИНФОРМАЦИИ</article-title><trans-title-group xml:lang="en"><trans-title>AN ALGORITHM OF MARKING IMAGES BASED ON THE VISUAL CRYPTOGRAPHY FOR PROTECTING FROM UNCONFIDENTIALITY INFORMATION DISTRIBUTION</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Борискевич</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Boriskevich</surname><given-names>A. A.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2012</year></pub-date><pub-date pub-type="epub"><day>03</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>5</issue><fpage>73</fpage><lpage>79</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Борискевич А.А., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Борискевич А.А.</copyright-holder><copyright-holder xml:lang="en">Boriskevich A.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.bsuir.by/jour/article/view/68">https://doklady.bsuir.by/jour/article/view/68</self-uri><abstract><p>Предлагается алгоритм маркирования изображений для защиты от копирования и незаконного распространения информации, основанный на принципах визуальной криптографии, представлении защищаемого изображения в виде набора взвешенных битовых плоскостей и двоичной маски маркирования (ДММ) в виде двух изображений-соответствий. Результаты моделирования показали, что алгоритм обеспечивает высокую защищенность изображений без изменения их качества и качественное восстановление ДММ пользователя без использования вычислительных средств.</p></abstract><trans-abstract xml:lang="en"><p>An algorithm of marking image protecting from copying and illegal distribution of information based on the visual cryptography principles, representing an original image in form of the weighted binary plane set and binary marking mask in form of two shadow image is proposed. The modeling result have shown that the algorithm provides the high protection level of the images without changing of the image quality and qualitative reconstruction of the binary marking mask without the computational tools.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>защищаемое изображение</kwd><kwd>визуальная криптография</kwd><kwd>маска маркирования</kwd><kwd>битовая плоскость</kwd><kwd>фрактальная структура</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Milano D. Content control: Digital watermarking and fingerprinting [Electronic resource]. Mode of access: www.rhozet.com/whitepapers/Fingerprinting_Watermarking.pdf.</mixed-citation><mixed-citation xml:lang="en">Milano D. Content control: Digital watermarking and fingerprinting [Electronic resource]. Mode of access: www.rhozet.com/whitepapers/Fingerprinting_Watermarking.pdf.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Noar M., Shamir A. // Advances in Cryptology: Eurocrypt'94. 1995. Vol. 950. P. 1-12.</mixed-citation><mixed-citation xml:lang="en">Noar M., Shamir A. // Advances in Cryptology: Eurocrypt'94. 1995. Vol. 950. P. 1-12.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ateniese G., Blundo C., De Santis A. et al. // Inf. Comput. 1996. Vol. 129, №2. P. 86-106.</mixed-citation><mixed-citation xml:lang="en">Ateniese G., Blundo C., De Santis A. et al. // Inf. Comput. 1996. Vol. 129, №2. P. 86-106.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Hwang, R.J. // Tamkang Journal of Science and Engineering. 2000. Vol. 3, №2. P. 97-106.</mixed-citation><mixed-citation xml:lang="en">Hwang, R.J. // Tamkang Journal of Science and Engineering. 2000. Vol. 3, №2. P. 97-106.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Surekha B., Swamy G.N., Srinivasa R.K. et al. // Journal of Information Assurance and Security. 2009. №4. P. 470-473.</mixed-citation><mixed-citation xml:lang="en">Surekha B., Swamy G.N., Srinivasa R.K. et al. // Journal of Information Assurance and Security. 2009. №4. P. 470-473.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Pal J.K., Mandal K., Dasgupta K. // International Journal of Network Security &amp; Its Applications. 2010. Vol. 2, №4. P. 118-127.</mixed-citation><mixed-citation xml:lang="en">Pal J.K., Mandal K., Dasgupta K. // International Journal of Network Security &amp; Its Applications. 2010. Vol. 2, №4. P. 118-127.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Борискевич А.А., Руис Л.А. // Сборник научных статей 6-я Международной научно-технической конференции Медэлектроника-2010. С. 34-37.</mixed-citation><mixed-citation xml:lang="en">Борискевич А.А., Руис Л.А. // Сборник научных статей 6-я Международной научно-технической конференции Медэлектроника-2010. С. 34-37.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
