[Resource Topic] 2007/382: Oblivious Transfer via McEliece's PKC and Permuted Kernels

Welcome to the resource topic for 2007/382

Oblivious Transfer via McEliece’s PKC and Permuted Kernels

Authors: K. Kobara, K. Morozov, R. Overbeck


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.

ePrint: https://eprint.iacr.org/2007/382

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .