Zero-Knowledge Proof (ZKP)

If the statement is true and both the prover and verifier follow the protocol honestly, the verifier will always be convinced by the proof. Completeness guarantees that a legitimate prover can successfully authenticate or prove a valid claim without false negatives.

• Mechanism: The protocol's mathematical construction ensures that a valid witness always maps to a verifiable transcript.
• Example: A prover who actually knows the password to a digital vault will always succeed in the ZKP challenge-response sequence.
• Failure Mode: A lack of completeness would mean a legitimate user is locked out of their own assets or identity.

If the statement is false, no cheating prover can convince the honest verifier that it is true, except with some negligible probability. Soundness is the security property that prevents forgery and impersonation.

• Computational Soundness: Assumes the prover is limited by polynomial-time computation (standard in practice).
• Statistical Soundness: Holds against an unbounded prover, offering stronger security guarantees.
• Knowledge Soundness: A stronger variant where an extractor algorithm can retrieve the secret witness from a successful prover, proving the prover actually 'knows' the data.

The verifier learns absolutely nothing beyond the single bit of information: 'the statement is true.' The Zero-Knowledge property ensures complete privacy of the underlying witness or secret data.

• Simulator Paradigm: For any verifier, there exists a simulator algorithm that can produce a transcript indistinguishable from a real interaction without access to the secret. This proves no information is leaked.
• Perfect vs. Computational: Perfect ZK means the distributions are identical; Computational ZK means they are indistinguishable by any efficient algorithm.
• Example: Proving you are over 21 without revealing your exact birth date, name, or address.

While early ZKPs required back-and-forth interaction, modern systems use Non-Interactive proofs where the prover generates a single, static proof that anyone can verify later.

• Fiat-Shamir Heuristic: Transforms interactive protocols into non-interactive ones by replacing the verifier's random challenges with the output of a cryptographic hash function.
• Advantage: Enables asynchronous verification, crucial for blockchain scalability where a single proof is posted on-chain and verified by thousands of nodes.
• Succinctness (zk-SNARKs): Many NIZKs are also 'Succinct,' meaning the proof size is tiny (often a few hundred bytes) and verification is exponentially faster than re-executing the computation.

ZKPs can be categorized by what they prove. A Proof of Knowledge demonstrates the prover knows a secret input (a witness), while a Proof of Membership proves a piece of data belongs to a specific set without revealing the data itself.

• Proof of Knowledge: 'I know the private key corresponding to this public key.' Used in authentication and identity systems.
• Proof of Membership (Merkle Proofs): 'My transaction is included in this valid block.' Used in private airdrops and blockchain light clients.
• Hybrid Use: Proving you possess a valid Verifiable Credential (membership in a registry) and that you know the signing key (proof of knowledge) without linking the two.

A relaxation of Zero-Knowledge where the proof does not reveal which witness was used, even if multiple witnesses exist for the same statement. Witness Indistinguishability (WI) is often easier to achieve and composes better under parallel execution.

• Key Difference: In ZK, the verifier learns nothing. In WI, the verifier might learn global information about the statement, but cannot distinguish which specific secret was used.
• Composability: WI protocols remain secure even when run in parallel, unlike some early ZK protocols.
• Application: Used in multi-party computation and anonymous credential systems where the statement has multiple valid proofs.

A pairing-based, multi-message digital signature scheme that enables selective disclosure and zero-knowledge proofs. A holder can derive a proof that reveals only a subset of signed attributes while keeping the rest hidden, without revealing a correlatable identifier. This is the foundational primitive for privacy-preserving verifiable credentials where minimal data exposure is required.

A privacy-preserving credential format utilizing Camenisch-Lysyanskaya (CL) signatures that supports both selective disclosure and zero-knowledge proofs. Unlike BBS+, AnonCreds uses a link secret to bind credentials to a holder without revealing a public identifier, preventing correlation across presentations. Widely deployed in Hyperledger Indy and AnonCreds v2.

The ability of a credential holder to reveal only specific attributes or claims from a verifiable credential to a verifier, minimizing unnecessary data exposure. ZKPs enable predicate proofs—proving statements like 'age > 21' without revealing the actual birthdate. This is a core requirement of ISO 18013-5 (mDL) and eIDAS 2.0 digital identity wallets.

A tamper-evident, cryptographically verifiable digital credential conforming to W3C Verifiable Credentials Data Model v2.0. VCs represent claims issued by an authority about a subject. When combined with ZKP-capable signature schemes like BBS+, VCs enable zero-knowledge presentations where a holder can prove possession of a valid credential and selectively disclose claims without revealing the full credential payload.

A secure, asynchronous, peer-to-peer messaging protocol designed for private communication between DID controllers. It uses end-to-end encryption based on decentralized keys and supports advanced routing through mediators. ZKPs can be integrated into DIDComm workflows to prove attributes about the sender without revealing identity, enabling anonymous yet authenticated machine-to-machine communication for sovereign AI agents.

The implementation of NIST-standardized algorithms like CRYSTALS-Dilithium and FALCON to protect decentralized identity systems from future quantum attacks. Current ZKP constructions relying on elliptic curve pairings (BLS12-381) are vulnerable to Shor's algorithm. Research into lattice-based ZKPs and STARKs aims to provide quantum-resistant zero-knowledge proofs for long-term sovereign identity security.