International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2009: Advances in Cryptology – ASIACRYPT 2009 pp 334-346

Simple Adaptive Oblivious Transfer without Random Oracle

  • Kaoru Kurosawa
  • Ryo Nojima
Conference paper

DOI: 10.1007/978-3-642-10366-7_20

Volume 5912 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kurosawa K., Nojima R. (2009) Simple Adaptive Oblivious Transfer without Random Oracle. In: Matsui M. (eds) Advances in Cryptology – ASIACRYPT 2009. ASIACRYPT 2009. Lecture Notes in Computer Science, vol 5912. Springer, Berlin, Heidelberg

Abstract

Adaptive oblivious transfer (OT) is a two-party protocol which simulates an ideal world such that the sender sends M1, ⋯ , Mn to the trusted third party (TTP), and the receiver receives \(M_{\sigma_i}\) from TTP adaptively for i = 1,2, ⋯ k. This paper shows the first pairing-free fully simulatable adaptive OT. It is also the first fully simulatable scheme which does not rely on dynamic assumptions. Indeed our scheme holds under the DDH assumption.

Keywords

Adaptive OTFully SimulatableDDHStandard Model
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Kaoru Kurosawa
    • 1
  • Ryo Nojima
    • 2
  1. 1.Ibaraki UniversityJapan
  2. 2.NICTJapan