Groth–Sahai proofs revisited E. Ghadafi, N.P. Smart, and B. Warinschi Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road,

First Page		Document Content
Date: 2010-01-17 10:23:34 Non-interactive zero-knowledge proof Mathematical proof Zero-knowledge proof Commitment scheme Cryptography Cryptographic protocols Decision Linear assumption		Groth–Sahai proofs revisited E. Ghadafi, N.P. Smart, and B. Warinschi Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 212,27 KB Share Document on Facebook

	Groth–Sahai proofs revisited E. Ghadafi, N.P. Smart, and B. Warinschi Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, DocID: 14Q82 - View Document
	Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University DocID: 13pBd - View Document
	The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions Brent Waters† University of Texas at Austin DocID: 12Nkf - View Document
	Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting Allison Lewko ∗ The University of Texas at Austin [removed] DocID: kltk - View Document