Abstract
We propose an efficient universally composable (UC) adaptive k-out-of-N oblivious transfer (\({\sf OT}_{k\times 1}^{N }\)) protocol over composite order bilinear group employing Groth-Sahai proofs, Boneh-Boyen signature and Bresson, Catalano and Pointcheval (BCP) encryption. Our scheme is proven to be UC secure in the presence of malicious adversary in static corruption model under decision Diffie-Hellman (DDH), subgroup decision (SD) and l-strong Diffie-Hellman (SDH) assumption. The proposed protocol is lightweight in the sense that it is storage-efficient with low communication and computation overheads as compared to the existing UC secure 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
