SNARK

snark Snark English Noun en computing cryptography en succinct non-interactive argument of knowledge. 2019, Anca Nitulescu, Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits, Peter Schwabe, Nicolas Thériault (editors), Progress in Cryptology – LATINCRYPT 2019: 6th International Conference, Proceedings, Springer, Lecture Notes in Computer Science LNCS 11774, page 223, SNARG vs. SNARK. If we replace the computational soundness with computational Knowledge Soundness we obtain what we call a SNARK, a succinct non-interactive argument of knowledge. 2020, Fuyuki Kitagawa, Takahiro Matsuda, Takashi Yamakawa, NIZK from SNARG, Rafael Pass, Krzysztof Pietrzak (editors), Theory of Cryptography: 18th International Conference, Proceedings, Part I, Springer, Lecture Notes in Computer Science LNCS 12550, page 568, Actually, what is often used in blockchains is a SNARK [4], which is a stronger variant of a SNARG that satisfies extractability. 2023, Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim, Impossibilities in Succinct Arguments: Black-Box Extraction and More, Nadia El Mrabet, Luca De Feo, Sylvain Duquesne (editors), Progress in Cryptology - AFRICACRYPT 2023: 14th International Conference, Proceedings, Springer, Lecture Notes in Computer Science LNCS 14064, page 467, Whether we can build SNARKs with black-box extraction in the standard model is an elusive problem.In particular, we show that a SNARG can be lifted to a SNARK with the features above for the class of languages FewP (roughly, NP with polynomial many witnesses). Related terms en SNARG Further reading Fiat-Shamir heuristic Proof of knowledge Interactive proof system