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

	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