Systematization of zero-knowledge proof methods
Radiotekhnika · 24.12.2025 · (223) · 38-43
DOI: 10.30837/rt.2025.4.223.04 ↗Kurz gefasst
Fachartikel in der Zeitschrift Radiotekhnika, online erschienen am 24.12.2025. Verfasst von R.I. Mordvinov.
Abstract (Originalsprache)
The article systematizes modern methods of zero-knowledge proof (ZKP). Classification features are considered: protocol interactivity, algebraic or stochastic basis, need for trusted setup, type of zero-knowledge, and proof model. Classical schemes (Fiat–Shamir, Schnorr, Blum), modern zk-SNARK and zk-STARK, as well as novel approaches – PLONK, Halo 2, Bulletproofs, lattice-based ZKPs, and machine learning proofs are described. A comparative analysis is conducted according to efficiency, proof size, generation and verification complexity. It is shown that SNARKs provide compactness but require a trusted setup, while STARKs are transparent and post-quantum secure but large. Open problems are highlighted: recursive proofs, standardization, metadata protection, and applications in machine learning. It is concluded that further research in this field is aimed at creating scalable, secure, and quantum-resistant protocols for digital technologies.
Zitieren
APA
Mordvinov, R. (2025). Systematization of zero-knowledge proof methods. Radiotekhnika, 38-43. https://doi.org/10.30837/rt.2025.4.223.04
Vancouver
Mordvinov R. Systematization of zero-knowledge proof methods. Radiotekhnika. 2025:38-43. doi:10.30837/rt.2025.4.223.04
BibTeX
@article{Mordvinov2025,
author = {Mordvinov, R.I.},
title = {Systematization of zero-knowledge proof methods},
journal = {Radiotekhnika},
year = {2025},
number = {223},
pages = {38--43},
doi = {10.30837/rt.2025.4.223.04}
}
EUVIMED