Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| zk-SNARK× | Kryptografia krzywych eliptycznych× | |
|---|---|---|
| Dziedzina | Kryptografia | Kryptografia |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 2014 | 1985 |
| Twórca≠ | Eli Ben-Sasson | Neal Koblitz |
| Typ≠ | zero-knowledge argument of knowledge | asymmetric encryption and key agreement |
| Źródło pierwotne≠ | 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. DOI ↗ | Miller, V. S. (1985). Use of Elliptic Curves in Cryptography. In Proceedings of the Advances in Cryptology - CRYPTO 1985, LNCS 218, pp. 417-426. DOI ↗ |
| Inne nazwy≠ | zk-SNARK, zero-knowledge proof, SNARK | ECC, elliptic curve cryptosystem |
| Pokrewne | 3 | 3 |
| Podsumowanie≠ | 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. |
| ScholarGateZbiór danych ↗ |
|
|