Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique∗ (Technical report – September 11, 2013) Luís T. A. N. Brandão† University of Lisbon - Demographics of Oceania - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-09-12 00:27:33 Cryptography Cryptographic protocols Garbled circuit Secure multi-party computation Commitment scheme Parameter		Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique∗ (Technical report – September 11, 2013) Luís T. A. N. Brandão† University of Lisbon Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 2,46 MB 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
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rauh - 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
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1qUxu - View Document