Σύγκριση μεθόδων

	zk-SNARK	Κρυπτογραφία Ελλειπτικών Καμπυλών	zk-STARK
Πεδίο	Κρυπτογραφία	Κρυπτογραφία	Κρυπτογραφία
Οικογένεια	Machine learning	Machine learning	Machine learning
Έτος προέλευσης	2014	1985	2018
Δημιουργός	Eli Ben-Sasson	Neal Koblitz	Eli Ben-Sasson
Τύπος	zero-knowledge argument of knowledge	asymmetric encryption and key agreement	transparent zero-knowledge argument of knowledge
Θεμελιώδης πηγή	Ben-Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014). Zerocash: Decentralized Anonymous Payments from Bitcoin. In IEEE Symposium on Security and Privacy (SP), pp. 459-474.	Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426.	Ben-Sasson, E., Bentov, I., Horesh, Y., & Riabzev, M. (2019). Scalable, transparent, and post-quantum secure computational integrity. In IACR Cryptology ePrint Archive, Report 2018/046.
Εναλλακτικές ονομασίες	zk-SNARK, zero-knowledge proof, SNARK	ECC, elliptic curve cryptosystem	zk-STARK, transparent argument of knowledge, STARK
Συναφείς	3	3	3
Σύνοψη	A zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) is a cryptographic proof system that allows a prover to convince a verifier that a statement is true without revealing any information beyond the statement's validity. The acronym describes its key properties: it requires no interaction, proofs are short (succinct), and verification is efficient. zk-SNARKs were popularized by their application in the Zcash cryptocurrency but have since found use in blockchain scaling solutions, privacy-preserving computations, and verifiable computing.	Elliptic Curve Cryptography (ECC) is a public-key cryptosystem based on the algebraic structure of elliptic curves over finite fields. Proposed independently by Neal Koblitz and Victor Miller in 1985, ECC offers equivalent security to RSA with much smaller key sizes. Modern cryptography increasingly favors ECC for its efficiency: a 256-bit ECC key provides security comparable to a 2048-bit RSA key, making it ideal for constrained environments and high-performance systems.	A zk-STARK (Zero-Knowledge Scalable Transparent Argument of Knowledge) is a cryptographic proof system allowing a prover to convince a verifier of a computation's correctness without trusted setup or revealing computational details. Introduced by Ben-Sasson and colleagues in 2018, zk-STARKs address a key limitation of zk-SNARKs: they require no preprocessing phase vulnerable to corruption. Instead, STARKs rely only on cryptographic hash functions, making them simpler, more transparent, and believed to be post-quantum secure.