Duration: 41:38

286 views

2

In this paper, we introduce a primitive known as Verifiable Oblivious Transfer. It is similar to oblivious transfer except that the sender is committed to its input. We then generate protocols for Generalized Oblivious Transfer by secret sharing using the Verifiable Oblivious Transfer primitive based on previous work. The protocols are universally composable. The GOT protocol is used to instantiate Batch Single-Choice Cut-And-Choose OT which in conjunction with a modification to the main protocol of [LP11], achieves constant round secure function evaluation based on Yao's Garbled Circuit. In addition, the idea of GOT is used in conjunction with linear secret sharing and commitments to instantiate a primitive known as Multi-Sender K-Out-of-N OT. This primitive is the most important building block of the optimization of the IPS compiler presented in [LOP11]. In contrast to their specific computational assumptions, our protocols only require black-box Verifiable OT. In addition, the GOT protocols can be used to execute Priced Oblivious Transfer.