Date Added: Nov 2012
Secure two-party and multiparty computation has long stood at the center of the foundations of theoretical cryptography. Recently, however, interest has grown regarding the efficiency of such protocols and their application in practice. As a result, there has been significant progress on this problem and it is possible to actually carry out secure computation for non-trivial tasks on reasonably large inputs. Part of this research goal of making secure computation practical has also involved implementations. Such implementations are of importance for two reasons: they demonstrate the real efficiency of known and new protocols and they deepen the authors' understanding regarding where the bottlenecks in efficiency lie.