Paper 2004/063 Original: eprint.iacr.org/2004/063 ↗
An Oblivious Transfer Protocol with Log-Squared Communication
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2005-07-05: last updated
- 2004-02-26: published
- Short URL
- https://ia.cr/2004/063
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/063,
author = {Helger Lipmaa},
title = {An Oblivious Transfer Protocol with Log-Squared Communication},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/063},
year = {2004},
url = {https://eprint.iacr.org/2004/063}
}