IEEE Information Theory Workshop (ITW)

Efficient fully simulatable oblivious transfer from the McEliece assumptions

Bernardo David, Anderson C. A. Nascimento

Published Oct 1, 2011• 2 citations

Abstract

We introduce the first efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common reference string model.

DOI: 10.1109/itw.2011.6089575

Related papers

Efficient Fully Simulatable Oblivious Transfer from the McEliece Assumptions

Bernardo David, Anderson C. A. Nascimento, Rafael T. de Sousa

We introduce an efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common reference string model. This is the first efficient fully simulatable oblivious protocol based on coding assumptions. Moreover, being based on the McEliece assumptions, the proposed protocol is a good candidate for the post-quantum scenario.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20124 citations

Efficient Fully-Simulatable Oblivious Transfer

Andrew Y. Lindell

Lecture notes in computer scienceJan 1, 200867 citations

Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols

Huafei Zhu

Lecture notes in computer scienceJan 1, 20080 citations

A Fully Simulatable Oblivious Transfer Scheme Using Vector Decomposition

Manoj Kumar, I. Praveen

Advances in intelligent systems and computingAug 28, 20144 citations

Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions

Bernardo David, Anderson C. A. Nascimento, Jörn Müller‐Quade

Lecture notes in computer scienceJan 1, 201214 citations

A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions

Preetha Mathew K., Sachin Vasant, Sridhar Venkatesan +1 more

Lecture notes in computer scienceJan 1, 20122 citations