Cryptology ePrint Archive: Report 2011/689
Available versions in chronological order
20111223:121647 (posted 23-Dec-2011 12:16:47 UTC)
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Seung Geol Choi and Jonathan Katz and Dominique Schröder and Arkady Yerukhimovich and Hong-Sheng Zhou
20130205:224632 (posted 05-Feb-2013 22:46:32 UTC)
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens
Seung Geol Choi and Jonathan Katz and Dominique Schröder and Arkady Yerukhimovich and Hong-Sheng Zhou
[
Cryptology ePrint archive
]