Towards Characterizing Complete Fairness in Secure Two-Party Computation

Gilad Asharov. Towards Characterizing Complete Fairness in Secure Two-Party Computation. In Yehuda Lindell, editor, Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings. Volume 8349 of Lecture Notes in Computer Science, pages 291-316, Springer, 2014. [doi]

Abstract

Abstract is missing.