Cryptology ePrint Archive: Report 2022/415

Efficient and Tight Oblivious Transfer from PKE with Tight Multi-User Security

Saikrishna Badrinarayanan and Daniel Masny and Pratyay Mukherjee

Abstract: We propose an efficient oblivious transfer in the random oracle model based on public key encryption with pseudorandom public keys. The construction is as efficient as the state of art though it has a significant advantage. It has a tight security reduction to the multi-user security of the underlying public key encryption. In previous constructions, the security reduction has a multiplicative loss that amounts in at least the amount of adversarial random oracle queries. When considering this loss for a secure parameter choice, the underlying public key encryption or elliptic curve would require a significantly higher security level which would decrease the overall efficiency.

Our OT construction can be instantiated from a wide range of assumptions such as DDH, LWE, or codes based assumptions as well as many public key encryption schemes such as the NIST PQC finalists. Since tight multi-user security is a very natural requirement which many public key encryption schemes suffice, many public key encryption schemes can be straightforwardly plugged in our construction without the need of reevaluating or adapting any parameter choices.

Category / Keywords: public-key cryptography / Oblivious Transfer, Public Key Encryption, MPC, Multi User Setting, Tightness

Date: received 31 Mar 2022, last revised 4 Apr 2022

Contact author: daniel masny at rub de

Available format(s): PDF | BibTeX Citation

Version: 20220404:164803 (All versions of this report)

Short URL: ia.cr/2022/415


[ Cryptology ePrint archive ]