Comparer des méthodes

	Preuve à divulgation nulle de connaissance	Analyse du cryptosystème RSA
Domaine	Cryptographie	Cryptographie
Famille	Process / pipeline	Process / pipeline
Année d'origine	1985	1978
Auteur d'origine	Shafi Goldwasser, Silvio Micali, Charles Rackoff	Ronald Rivest, Adi Shamir, Leonard Adleman
Type	Cryptographic authentication and verification	Asymmetric encryption and signature algorithm
Source fondatrice	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.
Alias	ZK Proof, Interactive Proof System, Non-interactive ZK Proof	RSA Analysis, Rivest–Shamir–Adleman Analysis
Apparentées	3	4
Résumé	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.	RSA (Rivest–Shamir–Adleman) is a foundational asymmetric cryptosystem introduced in 1978 that enables both encryption and digital signatures using a pair of public and private keys. It remains one of the most widely deployed cryptographic algorithms in modern security infrastructure, supporting secure communication and authentication across the internet.