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

	RFCSchnorr Non-interactive Zero-Knowledge Proof DocID: 1uoRK - 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
	Secure Two-Party Computation with Low Communication Ivan Damg˚ard∗ Sebastian Faust† Carmit Hazay‡ DocID: 1g45g - View Document
	BRICS Basic Research in Computer Science BRICS RSJ. Groth: Extracting Witnesses from Proofs of Knowledge Extracting Witnesses from Proofs of DocID: 1g0K6 - View Document