Zero-Knowledge Proofs and Their Applications for Information Processing into Untrusted Environments
The article is devoted to the analysis of methodological and practical aspects of using in computer systems one of the most important cryptographic primitives -zero-knowledge proofs. A brief description of the main stages of zero-knowledge concept, the typology and characteristics of the properties of the most commonly used zero-knowledge proof systems are given. The article discusses typical models of computing in untrusted environments, and describes the information security requirements for these models. As examples, applications of zero-knowledge proofs in two areas are given: in distributed registry systems and privacypreserving machine learning systems. In the final part of the article, current problems of the theory of zero-knowledge proofs and the practice of their application are considered.