Oblivious transfer with a memory-bounded receiver

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). I...

Full description

Saved in:
Bibliographic Details
Main Authors: Cachin, C., Crepeau, C., Marcil, J.
Format: Conference Proceeding
Language:English
Subjects:
Broadcasting
Collaboration
Computer science
Cryptographic protocols
Cryptography
Laboratories
Quantum computing
Security
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 /spl theta/(n/sup 2-2/spl alpha//) for some /spl alpha/< 1/2 , when a random string of size N=n/sup 2-/spl alpha/-/spl beta// is broadcast, for /spl alpha/>/spl beta/>0, whereas a malicious receiver can have up to /spl gamma/N bits of memory for any /spl gamma/
ISSN:0272-5428
DOI:10.1109/SFCS.1998.743500