2000 character limit reached
A new efficient k-out-of-n Oblivious Transfer protocol (0909.2852v1)
Published 15 Sep 2009 in cs.CR
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.