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

	The Complexity of Zero Knowledge Salil Vadhan∗ School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138 DocID: 1xW3t - View Document
	The Art of Cryptography Zero Knowledge Proofs Abhiram Kothapalli Two Balls and the Color-Blind Friend DocID: 1xVLd - View Document
	Zero-Knowledge Protocols for Search Problems Ben Berger Zvika Brakerski Weizmann Institute of Science, Israel∗ Abstract DocID: 1xVHq - View Document
	ZKProof Charter Boston, May 10th and 11th 2018 The goal of the ZKProof Standardardization effort is to advance the use of Zero Knowledge Proof technology by bringing together experts from industry and academia. To furthe DocID: 1xVl8 - View Document
	ZKBoo: Faster Zero-Knowledge for Boolean Circuits Irene Giacomelli Jesper Madsen Claudio Orlandi DocID: 1xVik - View Document