Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters

Wen-Guey Tzeng*

*此作品的通信作者

研究成果: Article同行評審

79 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose efficient and secure (string) oblivious transfer (OT n 1 ) schemes for any n ≥ 2. We build our OT n 1 scheme from fundamental cryptographic techniques directly. The receiver's choice is unconditionally secure and the secrecy of the unchosen secrets is based on the hardness of the decisional Diffie-Hellman problem. Some schemes achieve optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiver's choice is unconditionally secure. The distinct feature of our scheme is that the system-wide parameters are independent of n and universally usable, that is, all possible receivers and senders use the same parameters and need no trapdoors specific to each of them. We extend our OT n 1 schemes to distributed oblivious transfer schemes. Our distributed OT n 1 schemes take full advantage of the research results of secret sharing. For applications, we present a method of transforming any (single-database) PIR protocol into a symmetric PIR protocol by slightly increasing the communication cost only.

原文English
頁(從 - 到)232-240
頁數9
期刊IEEE Transactions on Computers
53
發行號2
DOIs
出版狀態Published - 1 二月 2004

指紋

深入研究「Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters」主題。共同形成了獨特的指紋。

引用此