Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

First Page		Document Content
Date: 2008-12-21 16:22:00 Oblivious transfer Decisional Diffie–Hellman assumption Commitment scheme Secure multi-party computation Communications protocol Zero-knowledge proof Proof of knowledge Cryptography Cryptographic protocols Universal composability		Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 237,53 KB Share Document on Facebook

	Session A1: Multi-Party Computation 1 CCS’17, October 30-November 3, 2017, Dallas, TX, USA Global-Scale Secure Multiparty Computation Xiao Wang DocID: 1xUHA - View Document
	Efficient Multi-Party Computation: from Passive to Active Security via Secure SIMD Circuits Daniel Genkin12 , Yuval Ishai1 , and Antigoni Polychroniadou3 1 DocID: 1xUE2 - View Document
	A New Approach to Interdomain Routing Based on Secure Multi-Party Computation Debayan Gupta∗, Aaron Segal∗, Aurojit Panda†, Gil Segev‡, Michael Schapira§, Joan Feigenbaum∗, Jennifer Rexford††, Scott Shenke DocID: 1xTeQ - View Document
	THE STRUCTURE OF SECURE MULTI-PARTY COMPUTATION BY MICHAEL J. ROSULEK B.S., Iowa State University, 2003 DocID: 1vp2V - View Document
	The Price of Low Communication in Secure Multi-Party Computation Juan Garay1 , Yuval Ishai2 , Rafail Ostrovsky3 , and Vassilis Zikas4 1 2 DocID: 1tYUs - View Document