## CryptoDB

### Paper: Oblivious Transfer via McEliece's PKC and Permuted Kernels

Authors: K. Kobara K. Morozov R. Overbeck URL: http://eprint.iacr.org/2007/382 Search ePrint Search Google We present two efficient protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 OT using the McEliece cryptosystem and Shamir's zero-knowledge identification scheme based on permuted kernels. This is a step towards diversifying computational assumptions on which OT -- the primitive of central importance -- can be based. Although we obtain a weak version of Rabin OT (where the malicious receiver may decrease his erasure probability), it can nevertheless be reduced to secure 1-out-of-2 OT. Elaborating on the first protocol, we provide a practical construction for 1-out-of-2 OT.
##### BibTeX
@misc{eprint-2007-13662,
title={Oblivious Transfer via McEliece's PKC and Permuted Kernels},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / Oblivious transfer, coding-based cryptography, McEliece cryptosystem, permuted kernel problem.},
url={http://eprint.iacr.org/2007/382},
note={ overbeck@cdc.informatik.tu-darmstadt.de, kirill.morozov@aist.go.jp 13858 received 26 Sep 2007, last revised 11 Dec 2007},
author={K. Kobara and K. Morozov and R. Overbeck},
year=2007
}