CISPA
Browse
2024-372.pdf (570.54 kB)

Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate.

Download (570.54 kB)
preprint
posted on 2024-05-22, 06:59 authored by Pedro Branco, Nico Döttling, Akshayaram Srinivasan
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)·poly(λ) 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).

History

Primary Research Area

  • Algorithmic Foundations and Cryptography

BibTeX

@misc{Branco:Döttling:Srinivasan:2024, title = "Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate.", author = "Branco, Pedro" AND "Döttling, Nico" AND "Srinivasan, Akshayaram", year = 2024, month = 2 }

Usage metrics

    Categories

    No categories selected

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC