sibsutisВестник СибГУТИThe Herald of the Siberian State University of Telecommunications and Information Science1998-6920СибГУТИ10.55648/1998-6920-2023-17-1-76-91sibsutis-560Research ArticleСОДЕРЖАНИЕСОДЕРЖАНИЕУсовершенствованная схема пороговой подписи CSI-FiSh со свойством быстрой сборки секретаImproved Threshold Signature Scheme CSI-FiSh with Fast Secret Recoveryhttps://orcid.org/0000-0002-5544-2434ДавыдовВ. В.DavydovV. V.

Давыдов Вадим Валерьевич, аспирант 4 года обучения факультета безопасности информационных технологий, преподаватель

197101, Санкт-Петербург, Кронверкский пр., д. 49, лит. А.

 

Vadim V. Davydov, 4th year PhD student of the Department of Information Security, lecturer

Kronverksky Pr. 49, bldg. A, St. Petersburg, 197101

vvdavydov@itmo.ruhttps://orcid.org/0000-0001-5494-7142ХуцаеваА. Ф.KhutsaevaA. F.

Хуцаева Алтана Феликсовна, инженер, магистрант 2 курса факультета безопасности информационных технологий

197101, Санкт-Петербург, Кронверкский проспект, д. 49, лит. А.

Altana F. Khutsaeva, Engineer, 2nd year master’s degree student of the Department of Information Security

Kronverksky Pr. 49, bldg. A, St. Petersburg, 197101

afkhutsaeva@itmo.ruhttps://orcid.org/0000-0002-0856-2249ИогансонИ. Д.IogansonI. D.

Иогансон Иван Дмитриевич, инженер, аспирант факультета безопасности информационных технологий

197101, Санкт-Петербург, Кронверкский проспект, д.49, литер А.

Ivan D. Ioganson, Engineer, PhD student of the Department of Information Security

Kronverksky Pr. 49, bldg. A, St. Petersburg, 197101

ivan.ioganson@yandex.ruhttps://orcid.org/0000-0002-4084-8829ДакуоЖ.-М. Н.DakuoZ.-M. N.

Дакуо Жан-Мишель Никодэмович, инженер, аспирант факультета безопасности информационных технологий

197101, Санкт-Петербург, Кронверкский проспект, д.49, литер А.

Zhan-Mishel N. Dakuo, Engineer, PhD student of the Department of Information Security

Kronverksky Pr. 49, bldg. A, St. Petersburg, 197101

jeandakuo@mail.ruhttps://orcid.org/0000-0002-0924-6221БеззатеевС. В.BezzateevS. V.

Беззатеев Сергей Валентинович, заведующий кафедрой информационной безопасности; директор лаборатории криптографических методов защиты информации

190000, Санкт-Петербург, ул. Большая Морская, д. 67, лит. А

197101, Санкт-Петербург, Кронверкский проспект, д.49, литер А.

Sergey V. Bezzateev, Head of Information Security Department; Director of Cryptographic Methods of Information Security Laboratory

190000, Saint-Petersburg, Bolshaya Morskaya str. 67, lit. A

Kronverksky Pr. 49, bldg. A, St. Petersburg, 197101

bsv@aanet.ruУниверситет ИТМОРоссияITMO University (ITMO)Russian FederationСанкт-Петербургский гос. унив. аэрокосмического приборостроения (ГУАП); Университет ИТМОРоссияSaint Petersburg State University of Aerospace Instrumentation (SUAI); ITMO University (ITMO)Russian Federation2023170220231717691Copyright © Давыдов В.В., Хуцаева А.Ф., Иогансон И.Д., Дакуо Ж.Н., Беззатеев С.В., 20232023Давыдов В.В., Хуцаева А.Ф., Иогансон И.Д., Дакуо Ж.Н., Беззатеев С.В.Davydov V.V., Khutsaeva A.F., Ioganson I.D., Dakuo Z.N., Bezzateev S.V.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://vestnik.sibsutis.ru/jour/article/view/560

В работе приводится новый вариант построения пороговой подписи CSI-FiSh, опубликованной в 2020 году (L. De Feo, M. Meyer). В предложенной схеме дополнительно обновляются открытые и закрытые ключи, что позволяет избежать случая компрометации дилера. В усовершенствованной схеме предлагается исключить последовательную передачу информации между пользователями при подписи и заменить её на сборку с участием дилера. Также в работе представлены экспериментальные результаты, подтверждающие эффективность предложенного подхода, и оценка безопасности полученной схемы.

The paper presents an improved version of the CSI-FiSh threshold signature offered by L. De Feo and M. Meyer in 2020. In the proposed scheme, public and private keys are additionally updated avoiding the case of compromising a dealer. It is also proposed to eliminate the sequential information transfer between participants when signing and replace it with an assembly with the participation of the dealer. Experimental results showing the effectiveness of the proposed approach and the assessment of the resulting scheme safety are presented.

криптография на изогениях эллиптических кривыхпостквантовая криптографияэлектронно-цифровая подписьпороговая подписьсхемы разделения секретаisogeny-based cryptographypost-quantum cryptographydigital signaturethreshold signaturesecret sharing schemesРабота выполнена при поддержке программы Приоритет-2030.Работа выполнена при поддержке программы Приоритет-2030.ReferencesGoldfeder S. et al. Securing bitcoin wallets via threshold signatures. 2014.Goldfeder S. et al. Securing bitcoin wallets via threshold signatures. 2014.Stathakopoulou C., Cachin C. Threshold signatures for blockchain systems //Swiss Federal Institute of Technology. 2017. V. 30. P. 1.Stathakopoulou C., Cachin C. Threshold signatures for blockchain systems. Swiss Federal Institute of Technology, 2017, vol. 30, pp. 1.Johnson D., Menezes A., Vanstone S. The elliptic curve digital signature algorithm (ECDSA) // International journal of information security. 2001. V. 1, № 1. P. 36–63.Johnson D., Menezes A., Vanstone S. The elliptic curve digital signature algorithm (ECDSA). International journal of information security, 2001, vol. 1, no. 1, pp. 36-63.Zhang F., Safavi-Naini R., Susilo W. An efficient signature scheme from bilinear pairings and its applications // International workshop on public key cryptography. Springer, Berlin, Heidelberg, 2004. P. 277–290.Zhang F., Safavi-Naini R., Susilo W. An efficient signature scheme from bilinear pairings and its applications. International workshop on public key cryptography, Springer, Berlin, Heidelberg, 2004, pp. 277- 290.Shor P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer // SIAM review. 1999. V. 41, № 2. P. 303–332.Shor P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 1999, vol. 41, no. 2, pp. 303-332.Ростовцев А. Г., Маховенко Е. Б. Криптосистема на категории изогенных эллиптических кривых // Проблемы информационной безопасности. Компьютерные системы. 2002. № 3. С. 74.Rostovcev A. G., Mahovenko E. B. Kriptosistema na kategorii izogennyh ellipticheskih krivyh [Cryptosystem on the category of isogenic elliptic curves] Problemy informacionnoj bezopasnosti. Komp'yuternye sistemy, Saint-Petersburg, 2002, no. 3, p. 74.Jao D. et al. SIKE: Supersingular isogeny key encapsulation // HAL. 2017.Jao D. et al. SIKE: Supersingular isogeny key encapsulation. HAL, 2017, vol. 2017.Computer Security Division I. T. L. Post-Quantum Cryptography | CSRC | CSRC // CSRC | NIST [Электронный ресурс]. URL: https://csrc.nist.gov/projects/post-quantumcryptography (accessed: 04.12.2022).Computer Security Division I. T. L. Post-Quantum Cryptography | CSRC | CSRC. CSRC | NIST, [Research and analysis of computer network monitoring tools and methods], available at: https://csrc.nist.gov/projects/post-quantum-cryptography (accessed: 04.12.2022).Castryck W., Decru T. An efficient key recovery attack on SIDH (preliminary version) // Cryptology ePrint Archive. 2022.Castryck W., Decru T. An efficient key recovery attack on SIDH (preliminary version). Cryptology ePrint Archive, 2022.Is SIKE broken yet? // Is SIKE broken yet? [Электронный ресурс]. URL: https://issikebrokenyet.github.io/ (accessed: 04.12.2022).Is SIKE broken yet? Is SIKE broken yet? [Research and analysis of computer network monitoring tools and methods], available at: https://issikebrokenyet.github.io/ (accessed: 04.12.2022).De Feo L., Galbraith S. D. SeaSign: compact isogeny signatures from class group actions // Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Cham, 2019. P. 759–789.De Feo L., Galbraith S. D. SeaSign: compact isogeny signatures from class group actions. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Cham, 2019, pp. 759-789.Beullens W., Kleinjung T., Vercauteren F. CSI-FiSh: efficient isogeny based signatures through class group computations // International Conference on the Theory and Application of Cryptology and Information Security. Springer, Cham, 2019. P. 227–247.Beullens W., Kleinjung T., Vercauteren F. CSI-FiSh: efficient isogeny based signatures through class group computations. International Conference on the Theory and Application of Cryptology and Information Security, Springer, Cham, 2019, pp. 227-247.De Feo L. et al. SQISign: compact post-quantum signatures from quaternions and isogenies // International Conference on the Theory and Application of Cryptology and Information Security. Springer, Cham, 2020. P. 64–93.De Feo L. et al. SQISign: compact post-quantum signatures from quaternions and isogenies. International Conference on the Theory and Application of Cryptology and Information Security, Springer, Cham, 2020, pp. 64-93Castryck W. et al. CSIDH: an efficient post-quantum commutative group action // International Conference on the Theory and Application of Cryptology and Information Security. Springer, Cham, 2018. P. 395–427.Castryck W. et al. CSIDH: an efficient post-quantum commutative group action. International Conference on the Theory and Application of Cryptology and Information Security, Springer, Cham, 2018, pp. 395-427.De Feo L., Meyer M. Threshold schemes from isogeny assumptions // IACR International Conference on Public-Key Cryptography. Springer, Cham, 2020. P. 187–212.De Feo L., Meyer M. Threshold schemes from isogeny assumptions. IACR International Conference on Public-Key Cryptography, Springer, Cham, 2020, pp. 187-212.Cozzo D., Smart N. P. Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol // International Conference on Post-Quantum Cryptography. Springer, Cham, 2020. P. 169–186.Cozzo D., Smart N. P. Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol. International Conference on Post-Quantum Cryptography, Springer, Cham, 2020, pp. 169-186.Vélu J. Isogénies entre courbes elliptiques // CR Acad. Sci. Paris, Séries A. 1971. V. 273. P. 305–347.Vélu J. Isogénies entre courbes elliptiques. CR Acad. Sci. Paris, Séries A, 1971, vol. 273, pp. 305-347.Silvermann J. H. The arithmetic of elliptic curves // Graduate Texts in Mathematics. 1986. V. 106.Silvermann J. H. The arithmetic of elliptic curves. Graduate Texts in Mathematics, 1986, vol. 106.Alamati N. et al. Cryptographic group actions and applications // International Conference on the Theory and Application of Cryptology and Information Security. Springer, Cham, 2020. P. 411–439.Alamati N. et al. Cryptographic group actions and applications. International Conference on the Theory and Application of Cryptology and Information Security, Springer, Cham, 2020, pp. 411-439.Sotakova J. Elliptic curves, isogenies, and endomorphism rings. P. 17.Sotakova J. Elliptic curves, isogenies, and endomorphism rings. p. 17.Stolbunov A. Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves // Advances in Mathematics of Communications. 2010. V. 4, № 2. P. 215.Stolbunov A. Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves. Advances in Mathematics of Communications, 2010, vol. 4, no. 2, p. 215.Couveignes J. M. Hard homogeneous spaces // Cryptology ePrint Archive. 2006.Couveignes J. M. Hard homogeneous spaces. Cryptology ePrint Archive, 2006.Shamir A. How to share a secret // Communications of the ACM. 1979. V. 22, № 11. P. 612–613.Shamir A. How to share a secret. Communications of the ACM, 1979, vol. 22, no. 11, pp. 612-613.Paillier P. Public-key cryptosystems based on composite degree residuosity classes // International conference on the theory and applications of cryptographic techniques. Springer, Berlin, Heidelberg, 1999. P. 223–238.Paillier P. Public-key cryptosystems based on composite degree residuosity classes. International conference on the theory and applications of cryptographic techniques, Springer, Berlin, Heidelberg, 1999, pp. 223-238.Paverd A., Martin A., Brown I. Modelling and automatically analysing privacy properties for honest-but-curious adversaries // Tech. Rep. 2014.Paverd A., Martin A., Brown I. Modelling and automatically analysing privacy properties for honest-butcurious adversaries. Tech. Rep., 2014.

The authors declare that there are no conflicts of interest present.