A new efficient k-out-of-n Oblivious Transfer protocol

TL;DR

This paper introduces a novel, efficient k-out-of-n oblivious transfer protocol that generalizes existing 1-out-of-2 protocols using Diffie-Hellman key exchange, enhancing secure multi-party communication.

Contribution

It proposes a new protocol for k-out-of-n oblivious transfer based on Diffie-Hellman, extending prior 1-out-of-2 methods with improved efficiency.

Findings

Protocol is more efficient than previous methods

Secure and oblivious key generation using Diffie-Hellman

Supports flexible k-out-of-n secret transfer

Abstract

This paper presents a new efficient protocol for k-out-of-n oblivious transfer which is a generalization of Parakh's 1-out-of-2 oblivious transfer protocol based on Diffie-Hellman key exchange. In the proposed protocol, the parties involved generate Diffie-Hellman keys obliviously and then use them for oblivious transfer of secrets.