Simulatable Adaptive Oblivious Transfer

  • Authors:
  • Jan Camenisch;Gregory Neven;Abhi Shelat

  • Affiliations:
  • IBM Research, Zurich Research Laboratory, CH-8803 Rüschlikon,;Katholieke Universiteit Leuven, Dept. of Electrical Engineering, B-3001 Heverlee, and Ecole Normale Supérieure, Département d'Informatique, 75230 Paris Cedex 05,;IBM Research, Zurich Research Laboratory, CH-8803 Rüschlikon,

  • Venue:
  • EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study an adaptivevariant of oblivious transfer in which a sender has Nmessages, of which a receiver can adaptively choose to receive kone-after-the-other, in such a way that (a) the sender learns nothing about the receiver's selections, and (b) the receiver only learns about the krequested messages. We propose two practical protocols for this primitive that achieve a stronger security notion than previous schemes with comparable efficiency. In particular, by requiring full simulatability for both sender and receiver security, our notion prohibits a subtle selective-failure attack not addressed by the security notions achieved by previous practical schemes.Our first protocol is a very efficient generic construction from unique blind signatures in the random oracle model. The second construction does not assume random oracles, but achieves remarkable efficiency with only a constant number of group elements sent during each transfer. This second construction uses novel techniques for building efficient simulatable protocols.