Compară metode

	Probă cu cunoștințe nule	Schema de semnătură digitală
Domeniu	Criptografie	Criptografie
Familie	Process / pipeline	Process / pipeline
Anul apariției	1985	1978
Autorul original	Shafi Goldwasser, Silvio Micali, Charles Rackoff	Ronald Rivest, Adi Shamir, Leonard Adleman
Tip	Cryptographic authentication and verification	Asymmetric signature algorithm
Sursa seminală	Goldwasser, S., Micali, S., & Rackoff, C. (1985). The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1), 186–208.	Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120–126.
Denumiri alternative	ZK Proof, Interactive Proof System, Non-interactive ZK Proof	Digital Signature Algorithm, Message Authentication and Integrity, Public Key Signature
Înrudite	3	4
Rezumat	A zero-knowledge proof is a cryptographic protocol in which a prover can convince a verifier that a statement is true without revealing any additional information beyond the truth of the statement. Introduced by Goldwasser, Micali, and Rackoff in 1985, zero-knowledge proofs have profound applications in authentication, privacy-preserving verification, and blockchain systems.	A digital signature scheme provides authentication, integrity assurance, and non-repudiation of electronically signed documents. Using public-key cryptography (such as RSA, DSA, or ECDSA), the originator signs a message with a private key in a way that any recipient can verify the signature using the originator's public key, proving that the message was created by the claimed author and has not been tampered with.