Zero Knowledge Proof: Revision history

From MNOwatch
Jump to navigationJump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

12 December 2025

  • curprev 08:5308:53, 12 December 2025 Demo talk contribs 2,383 bytes +4 No edit summary
  • curprev 08:5308:53, 12 December 2025 Demo talk contribs 2,379 bytes +24 No edit summary
  • curprev 08:5208:52, 12 December 2025 Demo talk contribs 2,355 bytes +2,355 Created page with "To prove a character set belongs to a string without revealing the set, you use *Zero-Knowledge Proofs* (ZKPs), specifically techniques like zk-SNARKs/STARKs or specialized commitment schemes (e.g., Merkle Trees, Pedersen Commitments) to generate a short proof that a commitment to the string and the set satisfies the "all characters in set" condition, verifiable with a public key/verifier, all without disclosing the actual characters of the string or set, only proving th..."
Retrieved from "https://mnowatch.org/wiki/index.php?title=Zero_Knowledge_Proof"