Oblivious transfer (OT) is a primitive of great importance in two-party and multi-party computation. We introduce a general construction of universally ...
... Very recently, David, Nascimento, and de Sousa (2012) proposed a fully simulatable OT protocol based on McEliece's assumptions (McEliece 1978). Subsequently ...
on the McEliece assumptions yields the first universally composable oblivious transfer protocol based on coding assumptions, which are also resistant to cur-.
Furthermore, we adapt the techniques of our general construction to obtain the first UC secure OT protocol based on the McEliece assumptions, which are coding ...
This motivates us to explore whether there exists an analogue of [19] in the ideal lattice setting with the help of a proper RLWE-based key exchange protocol.
People also ask
What is the relationship between public key encryption and oblivious transfer?
Bibliographic details on Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions.
Universally composable OT schemes in the ROM based on new hardness assumptions can be obtained from instantiating our framework. Examples are presented using ...
Universally Composable Oblivious Transfer Based on a Variant of LPN ... Moreover, it proves the equivalence of fully simulatable oblivious transfer and lossy ...
Abstract. Oblivious transfer (OT) is a fundamental two-party cryptographic primitive that implies secure multiparty computation. In this paper, we introduce ...
Nov 26, 2018 · Universally composable oblivious transfer from lossy encryption and the mceliece assumptions. In Adam Smith, editor,. Information Theoretic ...