標題: Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters
作者: Tzeng, WG
資訊工程學系
Department of Computer Science
關鍵字: oblivious transfer;distributed oblivious transfer;private information retrieval
公開日期: 1-Feb-2004
摘要: In this paper, we propose efficient and secure (string) oblivious transfer (OT(n)(1)) schemes for any n greater than or equal to 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.
URI: http://dx.doi.org/10.1109/TC.2004.1261831
http://hdl.handle.net/11536/27052
ISSN: 0018-9340
DOI: 10.1109/TC.2004.1261831
期刊: IEEE TRANSACTIONS ON COMPUTERS
Volume: 53
Issue: 2
起始頁: 232
結束頁: 240
Appears in Collections:Articles


Files in This Item:

  1. 000188196400010.pdf