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

	ON INTERACTIVE PROOFS WITH A LACONIC PROVER Oded Goldreich, Salil Vadhan, and Avi Wigderson Abstract. We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich and Hastad DocID: 1xTgs - View Document
	Lecture Notes on Pseudorandomness { Part I Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. email: DocID: 1v2G7 - View Document
	On the philosophical basis of computational theories Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. DocID: 1uRpC - View Document
	Robust PCPs of Proximity, Shorter PCPs and Applications to Coding Eli Ben-Sasson y Oded Goldreich z Prahladh Harsha x Salil Vadhan k DocID: 1uu6j - View Document
	On Basing One-Way Functions on NP-Hardness Adi Akavia Oded Goldreich MIT DocID: 1unrQ - View Document