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

	Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE DocID: 19hjI - View Document
	Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2 DocID: 18cff - View Document
	Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel. DocID: 13TpJ - View Document
	Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University DocID: 13pBd - View Document
	The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions Brent Waters† University of Texas at Austin DocID: 12Nkf - View Document