<?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="en"><front><journal-meta><journal-id journal-id-type="publisher-id">donstu</journal-id><journal-title-group><journal-title xml:lang="en">Advanced Engineering Research (Rostov-on-Don)</journal-title><trans-title-group xml:lang="ru"><trans-title>Advanced Engineering Research (Rostov-on-Don)</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2687-1653</issn><publisher><publisher-name>Don State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">donstu-887</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="en"><subject>PHYSICAL AND MATHEMATICAL SCIENCES</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ФИЗИКО-МАТЕМАТИЧЕСКИЕ НАУКИ</subject></subj-group></article-categories><title-group><article-title>VERIFICATION OF KEY MANAGEMENT CRYPTOGRAPHIC PROTOCOLS WITH COLORED PETRI NETS</article-title><trans-title-group xml:lang="ru"><trans-title>Верификация криптографических протоколов распределения ключей с использованием раскрашенных сетей Петри</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>Mogilevskaya</surname><given-names>Nadezhda S.</given-names></name></name-alternatives><email xlink:type="simple">broshka@nm.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><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>Kolchanov</surname><given-names>Sergey S.</given-names></name></name-alternatives><email xlink:type="simple">servatwork@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Донской государственный технический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Don State Technical University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2011</year></pub-date><pub-date pub-type="epub"><day>30</day><month>12</month><year>2011</year></pub-date><volume>11</volume><issue>9</issue><fpage>1535</fpage><lpage>1543</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Mogilevskaya N.S., Kolchanov S.S., 2011</copyright-statement><copyright-year>2011</copyright-year><copyright-holder xml:lang="ru">Могилевская Н.С., Колчанов С.С.</copyright-holder><copyright-holder xml:lang="en">Mogilevskaya N.S., Kolchanov S.S.</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://www.vestnik-donstu.ru/jour/article/view/887">https://www.vestnik-donstu.ru/jour/article/view/887</self-uri><abstract><p>The possibility of using colored Petri nets for the analysis of key distribution cryptographic protocols as an example of symmetric Needham—Schroeder protocol is reviewed and evaluated.</p></abstract><trans-abstract xml:lang="ru"><p>Рассмотрена и оценена возможность применения раскрашенных сетей Петри для анализа криптографических протоколов распределения ключей на примере симметричного протокола Нидхема — Шрёдера.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>верификация протокола</kwd><kwd>формальный анализ</kwd><kwd>распределение ключей</kwd><kwd>протокол Нидхема — Шрёдера</kwd><kwd>раскрашенные сети Петри</kwd><kwd>CPN Tools.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>protocol verification</kwd><kwd>formal analysis</kwd><kwd>key management</kwd><kwd>Needham—Schroeder protocol</kwd><kwd>colored Petri nets</kwd><kwd>CPN Tools.</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">Основы криптографии / А. П. Алфёров [и др.]. — Москва: Гелиос АРВ, 2005. — 480 с.</mixed-citation><mixed-citation xml:lang="en">Osnovy` kriptografii / A. P. Alfyorov [i dr.]. — Moskva: Gelios ARV, 2005. — 480 s. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Denning, D. E. Time stamps in Key Distribution Protocols / D. E. Denning, M. Smid // Com-munications of the ACM. — 1981. — V. 24. — P. 533—536.</mixed-citation><mixed-citation xml:lang="en">Denning, D. E. Time stamps in Key Distribution Protocols / D. E. Denning, M. Smid // Com-munications of the ACM. — 1981. — V. 24. — P. 533—536.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Котенко, И. В. Верификация протоколов безопасности на основе комбинированного использования существующих методов и средств / И. В. Котенко, С. А. Резник, А. В. Шоров // Труды СПИИРАН. — 2009. — Вып. 8. — С. 292—310.</mixed-citation><mixed-citation xml:lang="en">Kotenko, I. V. Verifikaciya protokolov bezopasnosti na osnove kombinirovannogo is-pol`zovaniya sushhestvuyushhix metodov i sredstv / I. V. Kotenko, S. A. Reznik, A. V. Shorov // Trudy` SPIIRAN. — 2009. — Vy`p. 8. — S. 292—310. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Могилевская, Н. С. Сравнение возможностей сетей Петри и BAN-логики в анализе криптографических протоколов проверки подлинности и обмена ключами / Н. С. Могилевская, С. С. Колчанов // Системный анализ, управление и обработка информации. — Ростов-на-Дону: Изд. центр ДГТУ, 2011. С. 98—101.</mixed-citation><mixed-citation xml:lang="en">Mogilevskaya, N. S. Sravnenie vozmozhnostej setej Petri i BAN-logiki v analize kriptografi-cheskix protokolov proverki podlinnosti i obmena klyuchami / N. S. Mogilevskaya, S. S. Kolchanov // Sistemny`j analiz, upravlenie i obrabotka informacii. — Rostov-na-Donu: Izd. centr DGTU, 2011. S. 98—101. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Смарт, Н. Криптография / Н. Смарт. — Москва: Техносфера, 2006. — 528 с.</mixed-citation><mixed-citation xml:lang="en">Smart, N. Kriptografiya / N. Smart. — Moskva: Texnosfera, 2006. — 528 s. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Lin, H. Algorithms for Cryptographic Protocol Verification in Presence of Algebraic Properties: diss. for the degree of Doctor of Philosophy (Mathematics). — Clarkson University, 2009.</mixed-citation><mixed-citation xml:lang="en">Lin, H. Algorithms for Cryptographic Protocol Verification in Presence of Algebraic Properties: diss. for the degree of Doctor of Philosophy (Mathematics). — Clarkson University, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Nieh, B. Modeling and analyzing cryptographic protocols using Petri nets / B. Nieh, S. Tavares // Auscrypt'92, 1992.</mixed-citation><mixed-citation xml:lang="en">Nieh, B. Modeling and analyzing cryptographic protocols using Petri nets / B. Nieh, S. Tavares // Auscrypt'92, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Salah, A. Protocol verification and analysis using colored Petri nets / A. Salah, M. Khaled. — Cairo University, 2003. — P. 3—7.</mixed-citation><mixed-citation xml:lang="en">Salah, A. Protocol verification and analysis using colored Petri nets / A. Salah, M. Khaled. — Cairo University, 2003. — P. 3—7.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Котов, В. Е. Сети Петри / В. Е. Котов. — Москва: Наука, 1984. — 160 с.</mixed-citation><mixed-citation xml:lang="en">Kotov, V. E. Seti Petri / V. E. Kotov. — Moskva: Nauka, 1984. — 160 s. — In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">CPN Tools Homepage. Documentation. Electronic resource. Access mode: http://cpntools.org/documentation/start/ (date of access: 11.04.2011).</mixed-citation><mixed-citation xml:lang="en">CPN Tools Homepage. Documentation. Electronic resource. Access mode: http://cpntools.org/documentation/start/ (date of access: 11.04.2011).</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>
