Paper 2024/1583
Efficient Pairing-Free Adaptable k-out-of-N Oblivious Transfer Protocols
Abstract
Oblivious Transfer (OT) is one of the fundamental building blocks in cryptography that enables various privacy-preserving applications. Constructing efficient OT schemes has been an active research area. This paper presents three efficient two-round pairing-free k-out-of-n oblivious transfer protocols with standard security. Our constructions follow the minimal communication pattern: the receiver sends k messages to the sender, who responds with n+k messages, achieving the lowest data transmission among pairing-free k-out-of-n OT schemes. Furthermore, our protocols support adaptivity and enable the sender to encrypt the n messages offline, independent of the receiver’s variables, offering significant performance advantages in one-sender-multiple-receiver scenarios. We provide security proofs under the Computational Diffie-Hellman (CDH) and RSA assumptions, without relying on the Random Oracle Model. Our protocols combine minimal communication rounds, adaptivity, offline encryption capability, and provable security, making them well-suited for privacy-preserving applications requiring efficient oblivious transfer.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. The ISC International Journal of Information Security
- DOI
- https://doi.org/10.22042/isecure.2025.237327
- Keywords
- Oblivious Transfer (OT)adaptable Oblivious Transferprivacy-preservingsecure multiparty computation
- Contact author(s)
-
keykhosro_khosravani @ ee sharif edu
teghlidos @ sharif edu
aref @ sharif edu - History
- 2026-10-01: last of 2 revisions
- 2024-10-07: received
- See all versions
- Short URL
- https://ia.cr/2024/1583
- License
-
CC BY-NC-ND
BibTeX
@misc{cryptoeprint:2024/1583,
author = {Keykhosro Khosravani and Taraneh Eghlidos and Mohammad reza Aref},
title = {Efficient Pairing-Free Adaptable k-out-of-N Oblivious Transfer Protocols},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1583},
year = {2024},
doi = {https://doi.org/10.22042/isecure.2025.237327},
url = {https://eprint.iacr.org/2024/1583}
}
