Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| HMAC× | zk-SNARK× | |
|---|---|---|
| Dziedzina | Kryptografia | Kryptografia |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1997 | 2014 |
| Twórca≠ | Hugo Krawczyk | Eli Ben-Sasson |
| Typ≠ | cryptographic authentication mechanism | zero-knowledge argument of knowledge |
| Źródło pierwotne≠ | Krawczyk, H., Bellare, M., & Crechanko, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104. link ↗ | 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 ↗ |
| Inne nazwy≠ | HMAC, keyed hash function | zk-SNARK, zero-knowledge proof, SNARK |
| Pokrewne | 3 | 3 |
| Podsumowanie≠ | HMAC (Hash-Based Message Authentication Code) is a cryptographic algorithm for authenticating messages using a secret key and a hash function. Standardized in RFC 2104 (1997), HMAC can be combined with any cryptographic hash function (SHA-256, SHA-3, etc.) to create a message authentication code (MAC). HMAC provides both data integrity and authentication, detecting both accidental corruption and deliberate tampering, and is widely used in web security (TLS/SSL), API authentication, and network protocols. | 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. |
| ScholarGateZbiór danych ↗ |
|
|