Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.