University of Tartu - ©2011 Rafik Chaabouni - Last update: 11.05.2011 15:46
Date: 13/05/2011 Location: J. Liivi 2, room 317 (next to the coffee room)
Speaker: Bingsheng Zhang
Title: Simulatable adaptive oblivious transfer with statistical receiver's privacy
Abstract:
During an adaptive oblivious transfer (OT), a sender has n private documents, and a receiver can adaptively fetch k documents from them such that the sender learns nothing about the receiver’s selection and the receiver learns nothing more than those k documents. Most recent fully simulatable adaptive OT schemes are based on so-called “assisted decryption†or “blind decryptionâ€. In this paper, we revisit another technique, “blind permute-decryptionâ€, for designing adaptive OT. We propose an efficient generic fully simulatable oblivious transfer framework with statistical receiver’s privacy that based on “blind permute-decryption†together with two concrete examples. The first one is based on Elgamal, so the corresponding OT is secure under classical DDH assumption. The second one is based on Paillier, so the corresponding OT is secure under Decisional n-th Residuosity assumption.