Welcome to the resource topic for 2010/199
Title:
A Framework for Fully-Simulatable t-out-of-n Oblivious Transfer
Authors: Bing Zeng, Christophe Tartary, Chingfang Hsu
Abstract:Oblivious transfer is a fundamental building block for multiparty computation protocols. In this paper, we present a generally realizable framework for fully-simulatable t-out-of-n oblivious transfer (\mbox{OT}^{n}_{t}) with security against non-adaptive malicious adversaries in the plain mode. Our construction relies on a single cryptographic primitive which is a variant of smooth projective hashing (SPH). A direct consequence of our work is that the existence of protocols for \mbox{OT}^{n}_{t} is reduced to the existence of this SPH variant. Before this paper, the only known reductions provided half-simulatable security and every known efficient protocol involved at least two distinct cryptographic primitives. We show how to instantiate this new SPH variant under not only the decisional Diffie-Hellman assumption, the decisional N-th residuosity assumption and the decisional quadratic residuosity assumption as currently existing SPH constructions, but also the learning with errors problem. Our framework only needs 4 communication rounds, which implies that it is more round-efficient than known protocols holding identical features.
ePrint: https://eprint.iacr.org/2010/199
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .