পদ্ধতির তুলনা করুন

	zk-SNARK	ল্যাটিস-ভিত্তিক ক্রিপ্টোগ্রাফি
ক্ষেত্র	ক্রিপ্টোগ্রাফি	ক্রিপ্টোগ্রাফি
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2014	1996
প্রবর্তক	Eli Ben-Sasson	Miklós Ajtai
ধরন	zero-knowledge argument of knowledge	public-key cryptosystem based on lattice hardness
মৌলিক উৎস	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.	Ajtai, M. (1996). Generating hard instances of the short basis problem. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 99-108.
অপর নাম	zk-SNARK, zero-knowledge proof, SNARK	lattice cryptography, post-quantum lattice cryptography
সম্পর্কিত	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.	Lattice-based cryptography is a class of cryptosystems whose security is derived from the computational hardness of lattice problems, particularly the shortest vector problem (SVP) and learning with errors (LWE). First proposed by Miklós Ajtai in 1996, lattice-based approaches have gained prominence as the leading candidates for post-quantum cryptography. Unlike RSA and ECC, which are vulnerable to quantum computers, lattice problems are believed to remain hard even against quantum algorithms.