Universally Composable Oblivious Transfer with Low Communication

Abstract

In this paper, a universally composable 1-out-of-N oblivious transfer protocol with low communication is built. This protocol obtained full simulation security based on the modulo learning with rounding (Mod-LWR) assumption. It can achieve universally composable security in the random oracle machine (ROM) model by combining random OT based on the key exchange protocol with the authentication encryption algorithm. It can be proven to resist static adversary attacks by simulating all corruption cases. Based on computer simulation and detailed mathematical derivation, this protocol was practicable and had better efficiency and lower communication.

Keywords

• oblivious transfer (OT)
• universal composability (UC)
• learning with rounding assumption
• random oracle model (ROM)
• static adversary attacks