On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R

First Page		Document Content
Date: 2016-05-31 08:55:32 Algebra Mathematics Multilinear algebra Non-interactive zero-knowledge proof Proof theory IP Snark Zero-knowledge proof Zero knowledge Soundness Bilinear map Model theory		On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 394,75 KB Share Document on Facebook

	A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK Sean Bowe, Ariel Gabizon, Matthew D. Green Zcash Abstract Recent efficient constructions of zero-knowledge Succinct Non-interactive DocID: 1uHJx - View Document
	2015 IEEE Symposium on Security and Privacy ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data Michael Backes DocID: 1pZM7 - View Document
	Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture DocID: 1lBYy - View Document
	Zerocash: Decentralized Anonymous Payments from Bitcoin (extended version) Eli Ben-Sasson∗ Alessandro Chiesa† DocID: 16Miz - View Document
	A Note on the Unsoundness of vnTinyRAM’s SNARK Bryan Parno Microsoft Research Abstract F’s inputs and outputs, if and only if there exist coefficients DocID: 12Zgz - View Document