Paper 2024/372 Original: eprint.iacr.org/2024/372 ↗
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate
Abstract
We give a construction of a two-round batch oblivious transfer (OT) protocol in the CRS model that is UC-secure against malicious adversaries and has (near) optimal communication cost. Specifically, to perform a batch of $k$ oblivious transfers where the sender's inputs are bits, the sender and the receiver need to communicate a total of $3k + o(k) \cdot \mathsf{poly}(\lambda)$ bits. We argue that $3k$ bits are required by any protocol with a black-box and straight-line simulator. The security of our construction is proven assuming the hardness of Quadratic Residuosity (QR) and the Learning Parity with Noise (LPN).
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-03-04: last updated
- 2024-02-29: published
- Short URL
- https://ia.cr/2024/372
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/372,
author = {Pedro Branco and Nico Döttling and Akshayaram Srinivasan},
title = {Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/372},
year = {2024},
url = {https://eprint.iacr.org/2024/372}
}