Metraipolis › archive › dc_c44ab6bb14c2

Zero-knowledge proof — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Zero-knowledge_proof
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T14:51:08.969Z
SHA-256 of the archived text
8df871fe544ab7e22fe8209a1d925d1bea3a617b32f8e0209fef106223d331d1
Stable URL of this page
https://metraipolis.com/documento/dc_c44ab6bb14c2

How to cite

Zero-knowledge proof — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Zero-knowledge_proof (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c44ab6bb14c2 (Metraipolis archive dc_c44ab6bb14c2, sha256 8df871fe544ab7e22fe8209a1d925d1bea3a617b32f8e0209fef106223d331d1)
BibTeX
@misc{dcc44ab6bb14c2,
  title = {Zero-knowledge proof — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Zero-knowledge_proof},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c44ab6bb14c2; sha256 8df871fe544ab7e22fe8209a1d925d1bea3a617b32f8e0209fef106223d331d1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Zero-knowledge_proof. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In cryptography, a zero-knowledge proof (also known as a ZK proof or ZKP) is a protocol in which one party (the prover) can convince another party (the verifier) that some given statement is true, without conveying to the verifier any information beyond the mere fact of that statement's truth. The intuition behind the nontriviality of zero-knowledge proofs is that it is trivial to prove possession of the relevant information simply by revealing it; the hard part is to prove this possession without revealing this information (or any aspect of it whatsoever). In light of the fact that one should be able to generate a proof of some statement only when in possession of certain secret information connected to the statement, the verifier, even after having become convinced of the statement's truth by means of a zero-knowledge proof, should nonetheless remain unable to prove the statement to further third parties. Zero-knowledge proofs can be interactive, meaning that the prover and verifier exchange messages according to some protocol, or noninteractive, meaning that the verifier is convinced by a single prover message and no other communication is needed. In the standard model, interaction is required, except for trivial proofs of BPP problems. In the common random string and random oracle models, non-interactive zero-knowledge proofs exist. The Fiat–Shamir heuristic can be used to transform certain interactive zero-knowledge proofs into noninteractive ones.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «zero-knowledge proof»).
Fonte: Wikipedia in inglese, voce «Zero-knowledge proof» — https://en.wikipedia.org/wiki/Zero-knowledge_proof
Wikidata Q191943 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q191943
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Zero-knowledge_proof?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378486867, consultata il 2026-10-15T14:02:51.099Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 9704023e915cafa715c5bb462cf9e51df141f42d384821cf3b969b45f9dc8969