O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, proceedings of 19th Annual ACM Symposium on Theory of Computing, pp.218-229, 1987.

O. Goldreich, Foundations of Cryptography, Volume II: Basic Applications, 2004.

V. Goyal, P. Mohassel, and A. Smith, Efficient Two Party and Multi Party Computation Against Covert Adversaries, EUROCRYPT 2008, pp.289-306, 2008.
DOI : 10.1007/978-3-540-78967-3_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.5841

Y. Lindell and B. Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries, EUROCRYPT, pp.52-78, 2007.

Y. Lindell and B. Pinkas, A Proof of Security of Yao???s Protocol for Two-Party Computation, Journal of Cryptology, vol.33, issue.4, pp.161-188, 2009.
DOI : 10.1007/s00145-008-9036-8

Y. Lindell and B. Pinkas, Secure two-party computation via cut-andchoose oblivious transfer, 8th TCC, pp.329-346, 2011.
DOI : 10.1007/s00145-011-9107-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7642

P. Mohassel and M. Franklin, Efficiency Tradeoffs for Malicious Two-Party Computation, Public Key Cryptography Conference, pp.458-473, 2006.
DOI : 10.1007/11745853_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.8323

M. Rabin, How to exhange secrets by oblivious transfer, 1981.

A. Shelat and C. Shen, Two-Output Secure Computation with Malicious Adversaries, Advances in Cryptology -Eurocrypt 2011, pp.386-405, 2011.
DOI : 10.1007/978-3-642-20465-4_22

P. David and . Woodruff, Revisiting the efficiency of malicious two party computation, EUROCRYPT 2007, pp.79-96, 2007.

A. C. Yao, How to generate and exchange secrets, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.162-167, 1986.
DOI : 10.1109/SFCS.1986.25