CryptoDB
An Oblivious Transfer Protocol with Log-Squared Communication
| Authors: | |
|---|---|
| Download: | |
| Abstract: | We propose a one-round $1$-out-of-$n$ computationally-private information retrieval protocol for $\ell$-bit strings with low-degree polylogarithmic receiver-computation, linear sender-computation and communication $\Theta(k\cdot\log^2{n}+\ell\cdot\log{n})$, where $k$ is a possibly non-constant security parameter. The new protocol is receiver-private if the underlying length-flexible additively homomorphic public-key cryptosystem is IND-CPA secure. It can be transformed to a one-round computationally receiver-private and information-theoretically sender-private $1$-out-of-$n$ oblivious-transfer protocol for $\ell$-bit strings, that has the same asymptotic communication and is private in the standard complexity-theoretic model. |
BibTeX
@misc{eprint-2004-12037,
title={An Oblivious Transfer Protocol with Log-Squared Communication},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols/computationally-private information retrieval, homomorphic public-key cryptosystem, oblivious transfer},
url={http://eprint.iacr.org/2004/063},
note={ISC 2005 lipmaa@cyber.ee 12969 received 25 Feb 2004, last revised 5 Jul 2005},
author={Helger Lipmaa},
year=2004
}