Technische Universitat Clausthal
Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is Oblivious Transfer (OT), which traditionally requires expensive public key cryptography. A more efficient way to perform many OTs is to extend a small number of base OTs using OT extensions based on symmetric cryptography. In this paper the authors present optimizations and efficient implementations of OT and OT extensions in the semi-honest model.