Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS

  • Seung Geol Choi
  • Jonathan Katz
  • Hoeteck Wee
  • Hong-Sheng Zhou
Conference paper

DOI: 10.1007/978-3-642-36362-7_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7778)
Cite this paper as:
Choi S.G., Katz J., Wee H., Zhou HS. (2013) Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS. In: Kurosawa K., Hanaoka G. (eds) Public-Key Cryptography – PKC 2013. Lecture Notes in Computer Science, vol 7778. Springer, Berlin, Heidelberg

Abstract

We present a general framework for efficient, universally composable oblivious transfer (OT) protocols in which a single, global, common reference string (CRS) can be used for multiple invocations of oblivious transfer by arbitrary pairs of parties. In addition:

  • Our framework is round-efficient. E.g., under the DLIN or SXDH assumptions we achieve round-optimal protocols with static security, or 3-round protocols with adaptive security (assuming erasure).

  • Our resulting protocols are more efficient than any known previously, and in particular yield protocols for string OT using O(1) exponentiations and communicating O(1) group elements.

Our result improves on that of Peikert et al. (Crypto 2008), which uses a CRS whose length depends on the number of parties in the network and achieves only static security. Compared to Garay et al. (Crypto 2009), we achieve adaptive security with better round complexity and efficiency.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Seung Geol Choi
    • 1
  • Jonathan Katz
    • 2
  • Hoeteck Wee
    • 3
  • Hong-Sheng Zhou
    • 2
  1. 1.Columbia UniversityUSA
  2. 2.University of MarylandUSA
  3. 3.George Washington UniversityUSA

Personalised recommendations