(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]

Authors

Seung Geol Choi

This author has not been identified. Look up 'Seung Geol Choi' in Google

Jonathan Katz

This author has not been identified. Look up 'Jonathan Katz' in Google

Dominique Schröder

This author has not been identified. Look up 'Dominique Schröder' in Google

Arkady Yerukhimovich

This author has not been identified. Look up 'Arkady Yerukhimovich' in Google

Hong-Sheng Zhou

This author has not been identified. Look up 'Hong-Sheng Zhou' in Google