SNARG

English Noun en computing cryptography en 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, Lecture Notes in Computer Science 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. en 2020 Melanie Swan; Renato P Dos Santos; Frank Witte Quantum Computing w:World Scientific https://books.google.com.au/books?id=FDHnDwAAQBAJ&pg=PA172&dq=%22snarg%22%7C%22snargs%22&hl=en&newbks=1&newbks_redir=0&sa=X&ved=2ahUKEwidhYTql7WAAxWV6zgGHVkODyIQ6AF6BAhBEAI#v=onepage&q=%22snarg%22%7C%22snargs%22&f=false 172 However, SNARGs and SNARKs (blockchain implementations of SNARGs) rely on pre-quantum assumptions and are not post-quantum secure. Hence, lattice-based SNARGs are proposed (Boneh et al., 2017). 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, Lecture Notes in Computer Science LNCS 13042, page 355, In this section, we construct SNARGs for languages with a (computational) non-signaling , assuming the existence of a SNARG for . Further reading Fiat-Shamir heuristic Proof of knowledge Interactive proof system