Abstract
Oblivious transfer is one of the basic building blocks of cryptography. Due to its importance as a building block in the construction of secure multiparty computation protocols, the efficiency and security are two big issues in its design. In this paper, we present an efficient, universal composable (UC) secure adaptive oblivious transfer without q-type assumptions. The proposed protocol is UC secure under Decision Linear (DLIN), Decision Bilinear Diffie-Hellman (DBDH) and Square Decision Bilinear Diffie-Hellman (SqDBDH) assumptions in the presence of malicious adversary in static corruption model. The proposed protocol exhibits low computation and communication overheads as compared to the existing similar schemes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
