Zero-disclosure proof

Бесплатный доступ

A zero-disclosure proof is a cryptographic protocol that allows one party (the prover) to confirm the truth of the statement to the other party (the verifier), while not disclosing any additional information about it (neither the content nor the source from which the prover learned about the truthfulness). This article shows that in practice any (mathematical) statement, logical condition - or even program code - can be translated using a special technique into "circuits" - expressions written in a special syntax suitable for zero-disclosure proof, the simplest and mathematized versions of the interactive protocol illustration are given, some ideas of proofs are described, the areas of possible application of ZKP are indicated. The algorithm allows you to authenticate users based on the existing chains of trust in the network. The main conclusion is that the use of ZKP will increase the privacy of users in public networks, the throughput of blockchains, strengthen information security by replacing inefficient authentication and verification methods.

Еще

Zero-knowledge proofs, logical condition, mathematized variant, bit, multiplicativity

Короткий адрес: https://sciup.org/170199227

IDR: 170199227   |   DOI: 10.24412/2500-1000-2023-4-4-138-141

Статья научная