The following publications are possibly variants of this publication:
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless TokensSeung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou. tcc 2014: 638-662 [doi]
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless TokensSeung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou. iacr, 2013:840, 2013. [doi]
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless TokensSeung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou. joc, 32(2):459-497, 2019. [doi]
- Universally-Composable Two-Party Computation in Two RoundsOmer Horvitz, Jonathan Katz. crypto 2007: 111-129 [doi]
- Universally Composable Multi-party Computation Using Tamper-Proof HardwareJonathan Katz. eurocrypt 2007: 115-128 [doi]