A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
Authors:
- Paulo S. L. M. BarretoPBPaulo S. L. M. Barreto
- Bernardo DavidBDBernardo David
- Rafael DowsleyRDRafael Dowsley
- Kirill MorozovKMKirill Morozov
- Anderson C. A. NascimentoANAnderson C. A. Nascimento
Preprint
Abstract
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation. We construct a round-optimal (2 rounds) universally composable (UC) protocol for oblivious transfer secure against active adaptive adversaries from any OW-CPA secure public-key encryption scheme with certain properties in the random oracle model (ROM). In terms of computation, our protocol only requires the generation of a public/secret-key pair, two encryption operations and one decryption operation, apart from a few calls to the random oracle. In~terms of communication, our protocol only requires the transfer of one public-key, two ciphertexts, and three binary strings of roughly the same size as the message. Next, we show how to instantiate our construction under the low noise LPN, McEliece, QC-MDPC, LWE, and CDH assumptions. Our instantiations based on the low noise LPN, McEliece, and QC-MDPC assumptions are the first UC-secure OT protocols based on coding assumptions to achieve: 1) adaptive security, 2) optimal round complexity, 3) low communication and computational complexities. Previous results in this setting only achieved static security and used costly cut-and-choose techniques.Our instantiation based on CDH achieves adaptive security at the small cost of communicating only two more group elements as compared to the gap-DH based Simplest OT protocol of Chou and Orlandi (Latincrypt 15), which only achieves static security in the ROM.Keywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens2015
- Authenticating Pervasive Devices with Human Protocols2005
- Randomness Re-use in Multi-recipient Encryption Schemeas2002
- Secure Human Identification Protocols2001
- Universally Composable Commitments2001
- Non-Interactive Oblivious Transfer and Applications2001
- Priced Oblivious Transfer: How to Sell Digital Goods2001
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms2000
- The All-or-Nothing Nature of Two-Party Secure ComputationLecture Notes in Computer Science, 1999
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions1999