Improved OT Extension for Transferring Short Secrets

We propose an optimization and generalization of OT extension of Ishai et al. of Crypto 2003. For computational security parameter $k$, our OT extension for short secrets offers $log k$ factor performance improvement in communication and computation, as compared to prior work. This results in corresponding improvements in applications relying on such OT. In particular, for two-party semi-honest SFE, this results in $log k$ factor improvement in communication over state-of-the art Yao Garbled Circuit (generalizing and slightly surpassing performance of recent construction of Kolesnikov and Kumaresan of SCN 2012). For multi-party semi-honest SFE, our construction implies $log k$ factor communication improvement.