We then show two efficient protocols such that the size of the commitments is only $(nB)$ regardless of the size of $W$, where $B$ is the size of each data. It is formally proved that $U$ learns nothing more and $T$ gains no information on the keywords which $U$ searched. We further present a more efficient adaptive $OT_k^n$ protocol than the previous one as an application of our first $OKS$ protocol.
Category / Keywords: cryptographic protocols / oblivious transfer Publication Info: Journal of Complexity, Vol.20 [2-3], pp. 356-371 (2004) Date: received 26 Nov 2002, last revised 8 Mar 2004 Contact author: kurosawa at cis ibaraki ac jp Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20040309:004415 (All versions of this report) Discussion forum: Show discussion | Start new discussion