Abstract
We implement one-out-of-two bit oblivious transfer (OT) based on the assumptions used in the McEliece cryptosystem: the hardness of decoding random binary linear codes, and the difficulty of distinguishing a permuted generating matrix of Goppa codes from a random matrix. To our knowledge this is the first OT reduction to these problems only. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Dowsley, R., Van De Graaf, J., Müller-Quade, J., & Nascimento, A. C. A. (2008). Oblivious transfer based on the McEliece assumptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5155 LNCS, pp. 107–117). https://doi.org/10.1007/978-3-540-85093-9_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
