Abstract: We introduce the first efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common reference ...
common reference string, we build the first efficient fully simulatable oblivious transfer protocol based on the McEliece assumptions. We build on the ...
We introduce the first efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common reference string model.
Nov 11, 2012 · SUMMARY. We introduce an efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common.
We introduce the first efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common reference string model.
Surprisingly, it is possible to achieve oblivious transfer under a wide variety of assumptions and adversary models [12, 16, 20, 24, 1, 18]. Oblivious ...
Missing: McEliece | Show results with:McEliece
Abstract. We implement one-out-of-two bit oblivious transfer (OT) based on the assump- tions used in the McEliece cryptosystem: the hardness of decoding ...
Recently, constructions of oblivious transfer based on coding theory hypotheses have been independently proposed in [6] and in [13]. In these cases, differently ...
We introduce the first efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common reference string model ...
Bibliographic details on Efficient Fully Simulatable Oblivious Transfer from the McEliece Assumptions.