Microsoft Word - TaskForceFinalReport.doc - Open publishing - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2008-11-10 22:21:05 Academic publishing Open access Communication Research Electronic publishing Postprint Preprint Institutional repository Born-digital Eprint California Digital Library		Microsoft Word - TaskForceFinalReport.doc Add to Reading List Source URL: socrates.berkeley.edu Download Document from Source Website File Size: 81,93 KB Share Document on Facebook

	Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby⋆ Ioanna Tzialla◦ abhi shelat† DocID: 1xW0V - View Document
	A Bit-fixing PRF with O(1) Collusion-Resistance from LWE Alex Davidson1,? and Ryo Nishimaki2 1 2 DocID: 1xVY7 - View Document
	Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond∗ Jeremiah Blocki Purdue University, Hong-Sheng Zhou Virginia Commonwealth University, DocID: 1xVWJ - View Document
	Short Double- and N -Times-Authentication-Preventing Signatures from ECDSA and More David Derler1 , Sebastian Ramacher1 , and Daniel Slamanig2 1 DocID: 1xVQK - View Document
	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 DocID: 1xVKy - View Document