<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.55648/1998-6920-2025-19-1-45-53</article-id><article-id custom-type="elpub" pub-id-type="custom">sibsutis-916</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>Passive secure three-party computation with an honest majority</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>Ratseev</surname><given-names>Sergey Mikhailovich</given-names></name></name-alternatives><email xlink:type="simple">ratseevsm@mail.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>Cherevatenko</surname><given-names>Olga Ivanovna</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ульяновский государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Ulyanovsk State University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Ульяновский государственный педагогический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Ulyanovsk State Pedagogical University named after I.N. Ulyanov</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>21</day><month>03</month><year>2025</year></pub-date><volume>19</volume><issue>1</issue><issue-title>Вестник СибГУТИ</issue-title><fpage>45</fpage><lpage>53</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Рацеев С.М., Череватенко О.И., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Рацеев С.М., Череватенко О.И.</copyright-holder><copyright-holder xml:lang="en">Ratseev S.M., Cherevatenko O.I.</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://vestnik.sibsutis.ru/jour/article/view/916">https://vestnik.sibsutis.ru/jour/article/view/916</self-uri><abstract><p>В 2016 г. авторы Araki T., Furukawa J., Lindell Y., Nof A. и Ohara K. представили протокол AFLNO для треxстороннего вычисления любой функциональности с честным большинством и пассивным противником. Этот протокол имеет небольшую вычислительную и коммуникационную сложность. Указанные авторы не приводят полных протоколов как для вычисления логических схем, так и для вычисления арифметических схем, показывая лишь идеи для этих протоколов. В данной работе приводятся полные протоколы безопасных вычислений.</p></abstract><trans-abstract xml:lang="en"><p>In 2016, the authors Araki T., Furukawa J., Lindell Y., Of A. and Ohara K. introduced a new information-theoretic protocol (and a computationally-secure variant) for secure three-party computation with an honest majority. The protocol has very minimal computation and communication. The authors did not provide a complete protocols. This paper provides complete protocols for secure multiparty computation.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>криптографический протокол</kwd><kwd>многосторонние вычисления</kwd><kwd>схема разделения секрета</kwd></kwd-group><kwd-group xml:lang="en"><kwd>cryptographic protocol</kwd><kwd>multiparty computation</kwd><kwd>secret sharing</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">Рацеев С. М. Криптография. Безопасные многосторонние вычисления : учеб. пособие для вузов. СПб. : Лань, 2025. 468 с.</mixed-citation><mixed-citation xml:lang="en">Ratseev S. M. Kriptografiya. Bezopasnye mnogostoronnie vychisleniya [Cryptography. Secure multiparty computation]. St. Petersburg: Lan Publishing House, 2024. 468 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Feng D., Yang K. Concretely efficient secure multi-party computation protocols: survey and more // Security and Safety. 2022. Vol. 1. P. 1–43. DOI: 10.1051/sands/2021001</mixed-citation><mixed-citation xml:lang="en">Feng D., Yang K. Concretely efficient secure multi-party computation protocols: survey and more //</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Araki T., Furukawa J., Lindell Y., Nof A., Ohara K. High throughput semi-honest secure three-party computation with an honest majority // 2016. ACM. P. 805–817. DOI: 10.1145/2976749.2978331</mixed-citation><mixed-citation xml:lang="en">Security and Safety. 2022. Vol. 1. P. 1–43. DOI: 10.1051/sands/2021001</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Рацеев С. М. Криптографические протоколы. Схемы разделения секрета : учебное пособие для вузов. СПб. : Лань, 2024. 336 с.</mixed-citation><mixed-citation xml:lang="en">Araki T., Furukawa J., Lindell Y., Nof A., Ohara K. High throughput semi-honest secure three-party computation with an honest majority // 2016. ACM. P. 805–817. DOI: 10.1145/2976749.2978331</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Ratseev S. M. Kriptograficheskie protokoly. Skhemy razdeleniya sekreta [Cryptographic protocols. Secret sharing schemes]. St. Petersburg: Lan Publishing House, 2024. 336 p.</mixed-citation><mixed-citation xml:lang="en">Ratseev S. M. Kriptograficheskie protokoly. Skhemy razdeleniya sekreta [Cryptographic protocols. Secret sharing schemes]. St. Petersburg: Lan Publishing House, 2024. 336 p.</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>
