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

	UNIVERSAL IDENTITIES, II: ⊗ AND ∧ KEITH CONRAD 1. Introduction We will describe how algebraic identities involving operations of multilinear algebra – the tensor product and exterior powers – can be proved by the DocID: 1vs1s - View Document
	L. De Lathauwer An Introduction to Multilinear Algebra Based Independent Component Analysis Lieven De Lathauwer DocID: 1trD8 - View Document
	Linear and Multilinear Algebra ISSN: PrintOnline) Journal homepage: http://www.tandfonline.com/loi/glma20 Intervals of special sign regular matrices Mohammad Adm & Jürgen Garloff DocID: 1tb0g - View Document
	Linear and Multilinear Algebra, 1977, Vol. 5, pp © Gordon and Breach Science Publishers Ltd., 1977 Printed in Great Britain This material may be protected by copyright law DocID: 1sTKG - View Document
	Data Mining and Knowledge Discovery manuscript No. (will be inserted by the editor) Clustering Boolean Tensors Saskia Metzler · Pauli Miettinen DocID: 1r3eG - View Document