SNARG

== English == === Noun === SNARG (plural SNARGs) (computing, cryptography) Acronym of succinct non-interactive argument. 2018, Dan Boneh, Yuval Ishai, Amit Sahai, David J. Wu, Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs, Jesper Buus Nielsen, Vincent Rijmen (editors), Advances in Cryptology – EUROCRYPT 2018: 37th Annual International Conference on Cryptographic Techniques, Proceedings, Part III, Springer, LNCS 10822, page 224, A SNARG is publicly verifiable if anyone can verify the proofs, and it is designated-verifier if only the holder of a secret verification state (generated along with the CRS[common reference string]) can verify proofs. 2021, Yael Taumann Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang, Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs, Kobbi Nissim, Brent Waters (editors), Theory of Cryptography: 19th International Conference, TCC 2021, Proceedings, Part I, Springer, LNCS 13042, page 355, In this section, we construct SNARGs for languages with a (computational) non-signaling P C P {\displaystyle {\mathsf {PCP}}} , assuming the existence of a SNARG for B a t c h N P {\displaystyle {\mathsf {BatchNP}}} . === Further reading === Fiat-Shamir heuristic on Wikipedia.Wikipedia Proof of knowledge on Wikipedia.Wikipedia Interactive proof system on Wikipedia.Wikipedia