How not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios David Bernhard1 , Olivier Pereira2 , and Bogdan Warinschi1 1

First Page		Document Content
Date: 2016-08-10 06:31:48 Cryptography Computational complexity theory Zero-knowledge proof Interactive proof system FiatShamir heuristic Proof of knowledge IP Non-interactive zero-knowledge proof Random oracle ElGamal encryption NP RSA		How not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios David Bernhard1 , Olivier Pereira2 , and Bogdan Warinschi1 1 Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 406,33 KB Share Document on Facebook

	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rsiG - View Document
	A Commitment-Consistent Proof of a Shuﬄe Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically DocID: 1r7EK - View Document
	Efficient Anonymity-Preserving Data Collection Justin Brickell and Vitaly Shmatikov Department of Computer Sciences The University of Texas at Austin Austin, TX, USA DocID: 1qCnF - View Document
	Stealing Keys from PCs using a Radio: Cheap Electromagnetic Attacks on Windowed Exponentiation (extended version) Daniel Genkin Lev Pachmanov DocID: 1qxjY - View Document
	Simplified Submission of Inputs to Protocols Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. Consider an electronic election scheme implemented using a DocID: 1q9YH - View Document