A Framework for Efficient and Composable Oblivious Transfer
Speaker: Vinod Vaikuntanathan , CIS, TOC, CSAIL, MIT
Date: January 11 2008
Time: 10:30AM to 12:00PM
Location: 32-G449 Patil-Kiva
Contact: Be Blackburn, 3-6098, imbe@mit.edu
We propose a simple and general framework for constructing *oblivious
transfer* (OT) protocols that are efficient, universally composable,
and generally realizable from a variety of cryptographic assumptions,
such as the decisional Diffie-Hellman assumption, the Quadratic
Residuosity assumption and worst-case complexity assumptions relating
to *lattices*. Our OT protocols are round-optimal (one message each
way) and efficient in the parties' communication and local
computation, and use only one reference string for an unbounded number
of executions.
One of our key technical contributions is a unified view of several
encryption schemes in the literature that have what we call
"message-lossy" public keys, whose defining property is that a
ciphertext produced under such a key carries *no information* (even
statistically) about the encrypted message.
Joint work with Chris Peikert and Brent Waters.
See other events that are part of Cryptography and Information Security Seminars 2007/2008
See other events happening in January 2008
