Source: wikibot/completeness-cryptography
= Completeness (cryptography)
{wiki=Completeness_(cryptography)}
In cryptography, **completeness** often refers to a property of certain cryptographic protocols or systems, particularly in the context of zero-knowledge proofs and interactive proof systems. A protocol or system is said to be complete if, when the statement being proven is true, an honest prover can convince an honest verifier of that truth with high probability.