(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens

Seung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou. (Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens. IACR Cryptology ePrint Archive, 2011:689, 2011. [doi]

Abstract

Abstract is missing.