|
Abstract : |
We propose a protocol for oblivious transfer that is unconditionally secure under the sole assumption that the memory size of the receiver is bounded. The model assumes that a random bit string slightly larger than the receiver?s memory is broadcast (either by the sender or by a third party). In our construction, both parties need memory of size in for ? some , when a string of size ? for is broadcast, whereas a malicious receiver can have up ? to bits of memory for ? any. In the course of our analysis, we provide a direct study of an interactive hashing protocol closely related to that of Naor et al. [NOVY98]. 1, |
