GOST 34.11-2018 Analysis in The Context of Zero-Knowledge Proofs
| Autor: | Vladlen D. Afonin, Sergey V. Zapechnikov, Igor A. Prostov |
|---|---|
| Jazyk: | English<br />Russian |
| Rok vydání: | 2024 |
| Předmět: | |
| Zdroj: | Безопасность информационных технологий, Vol 31, Iss 2, Pp 91-89 (2024) |
| Druh dokumentu: | article |
| ISSN: | 2074-7128 2074-7136 |
| DOI: | 10.26583/bit.2024.2.05 |
| Popis: | Zero-knowledge proofs are being increasingly applied to a wide range of tasks in modern distributed information systems. Of particular interest are such areas of activity as digital asset management systems, anonymous electronic voting systems, and anonymous credentials. Nevertheless, within the framework of the desire of Russian developers to localize the developed products, there is a question of compliance of the used algorithms with the legislative framework of the Russian Federation, which obliges developers to use local cryptographic standards. As our analysis shows, insufficient attention has been paid in the literature to the applicability of these standards to the scenario of use in zero-knowledge proof systems. In particular, the complexity of proof generation, parameters of arithmetic schemes are not analyzed, there is no comparison of computational complexity and cryptographic properties with foreign alternatives. In this paper we consider in detail the peculiarities of implementation of the arithmetic scheme for the function of GOST 34.11-2018 in the most widespread language for arithmetic circuit programming Circom. The developed program code is open and available for use and modification. The characteristics of the scheme, compilation and generation times are analyzed. The obtained results were compared with other popular hash functions: the cryptographic hash function SHA256 included in the standard language library, and the hash function Poseidon, specialized and optimized for use in zero-knowledge proof systems. The results show that while the use of the Russian hash function is possible, it is not desirable in applications that do not require the use of local cryptographic standards, due to the greater time complexity of witness generation and consequently proof generation. Recommendations on usage scenarios are given and further research directions are suggested. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|