On the Efficiency of Classical and Quantum Secure Function Evaluation
The authors provide bounds on the efficiency of secure one sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results they derive bounds on the efficiency of protocols that use different variants of OT as a black-box. When applied to implementations of OT, these bounds generalize most known results to the statistical case. Their results hold in particular for transformations between a finite number of primitives and for any error. In the second part they study the efficiency of quantum protocols implementing OT.