Efficient Secure Two-Party Protocols: Techniques and Constructions

First Page		Document Content
Date: 2014-09-16 07:30:08 Secure two-party computation Zero-knowledge proof Commitment scheme Oblivious transfer Computational indistinguishability Oded Goldreich Ciphertext indistinguishability Man-in-the-middle attack Cryptography Cryptographic protocols Secure multi-party computation		Efficient Secure Two-Party Protocols: Techniques and Constructions Add to Reading List Source URL: www.eng.biu.ac.il Download Document from Source Website File Size: 270,33 KB Share Document on Facebook

	The proceedings version of this paper appears in ACM CCSThis is the full version of that paper. Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗ DocID: 1qpgb - View Document
	Electronic Colloquium on Computational Complexity, Report NoBounded Indistinguishability and the Complexity of Recovering Secrets Andrej Bogdanov∗ DocID: 1nxHl - View Document
	Computational Indistinguishability Logics Bruce M. Kapron Computer Science Department University of Victoria June 27, 2009 DocID: 1lf8X - View Document
	Inductive Proof Method for Computational Secrecy Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell Department of Computer Science, Stanford University Abstract. We investigate inductive methods for proving secrecy p DocID: 1jYjV - View Document
	Efficient Secure Two-Party Protocols: Techniques and Constructions DocID: 1garM - View Document