Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two - Zero-knowledge proof - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-06-28 21:51:08 Cryptography Public-key cryptography Commitment scheme Secret sharing Zero-knowledge proof Cryptographic hash function Coin flipping Universal composability Cryptographic primitive One-way function Claw-free permutation RSA		Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 1,24 MB Share Document on Facebook

	Universal Composability Proving the Correctness of Blockchain Protocols Abhiram Kothapalli DocID: 1ulMc - View Document
	Systematizing Secure Computation for Research and Decision Support Jason Perry1 , Debayan Gupta2 , Joan Feigenbaum2 and Rebecca N. Wright1 1 DocID: 1rpD9 - View Document
	LNCSPractical Private Information Aggregation in Large Networks DocID: 1pxiz - View Document
	Systematizing Secure Computation for Research and Decision Support Jason Perry1 , Debayan Gupta2 , Joan Feigenbaum2 and Rebecca N. Wright1 1 DocID: 1oJIr - View Document
	Universally Composable Commitments Using Random Oracles Dennis Hofheinz† and J¨orn M¨ uller-Quade† Abstract. In the setting of universal composability [Can01], commitments cannot be implemented without additional DocID: 1nBvB - View Document