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.

Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this article, we present protocols for mutual exchange of secrets, 1-out-of-2 OT and coin-flipping similar to the Diffie-Hellman protocol using the idea of obliviously exchanging encryption keys. Since the Diffie-Hellman scheme is widely used, our protocol may provide a useful alternativ...

This paper studies the mapping g → g 2 (mod p) by showing that it inherits its structure from the mapping x → x (mod ordp(g)). We first explore the context in which this mapping is important; specifically, we consider the Diffie-Hellman protocol, Diffie-Hellman problem, and the various problems that have spawned from these including the discrete logarithm and square exponent problems. We then d...

A generalization of the original Diffie-Hellman key exchange in (Z/pZ) found a new depth when Miller [21] and Koblitz [9] suggested that such a protocol could be used with the group over an elliptic curve. In this paper, we extend such a generalization to the setting of a semigroup action (G-action) on a finite set. We define these extended protocols, show how it is related to the general Diffi...

This paper gives the first bit security result for the elliptic curve Diffie–Hellman key exchange protocol for elliptic curves defined over prime fields. About 5/6 of the most significant bits of the x-coordinate of the Diffie–Hellman key are as hard to compute as the entire key. A similar result can be derived for the 5/6 lower bits. The paper also generalizes and improves the result for ellip...