Oblivious Transfer in the Bounded Storage Model

Building on a previous important work of Cachin, Cr´epeau, and Marcil [15], we present a provably secure and more efficient protocol for 2 1 -Oblivious Transfer with a storage-bounded receiver. A public random string of n bits long is employed, and the protocol is secure against

• Type: Conference
• Year: 2001
• Where: CRYPTO
• Authors: Yan Zong Ding
• Keywords: CRYPTO 2001, Cryptology, Efficient Protocol, Provably Secure, Public Random String