Welcome to the resource topic for 2024/372
Title:
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate
Authors: Pedro Branco, Nico Döttling, Akshayaram Srinivasan
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).
ePrint: https://eprint.iacr.org/2024/372
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .