International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

A Framework For Fully-Simulatable $h$-Out-Of-$n$ Oblivious Transfer

Authors:
Zeng Bing
Tang Xueming
Chingfang Hsu
Download:
URL: http://eprint.iacr.org/2010/199
Search ePrint
Search Google
Abstract: In this paper, we present a framework for efficient, fully-simulatable $h$-out-of-$n$ oblivious transfer ($OT^{n}_{h}$) with security against nonadaptive malicious adversary. The number of communication round of the framework is six. Compared with existing fully-simulatable $OT^{n}_{h}$, our framework is round-efficient. Conditioning on no trusted common string is available, our DDH-based instantiation is the most efficient protocol for $OT^{n}_{h}$. Our framework uses three abstract tools, i.e. perfectly binding commitment, perfectly hiding commitment and our new smooth projective hash. This allows a simple and intuitive understanding of its security. We instantiate the new smooth projective hash under the lattice, decisional Diffie-Hellman, decisional N-th residuosity, decisional quadratic residuosity assumptions. This indeed shows that the folklore that it is technically difficult to instantiate the projective hash framework under the lattice assumption is not true. What's more, by using this lattice-based instantiation and Brassard's commitment scheme, we gain a $OT^{n}_{h}$ instantiation which is secure against any quantum algorithm.
BibTeX
@misc{eprint-2010-23100,
  title={A Framework For Fully-Simulatable $h$-Out-Of-$n$  Oblivious Transfer},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / oblivious transfer,public-key cryptography, quantum cryptography,lattice techniques},
  url={http://eprint.iacr.org/2010/199},
  note={ zeng.bing.zb@gmail.com; 14722 received 9 Apr 2010, last revised 23 Apr 2010},
  author={Zeng Bing and Tang Xueming and Chingfang Hsu},
  year=2010
}