Cryptology ePrint Archive: Report 2010/284
Available versions in chronological order
20100514:111842 (posted 14-May-2010 11:18:42 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
20110307:213042 (posted 07-Mar-2011 21:30:42 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
Publication Info: An extended abstract of this paper appeared in TCC 2011. This is the full version.
20110701:130549 (posted 01-Jul-2011 13:05:49 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
Publication Info: An extended abstract appeared in TCC 2011; this is the full version.
20110918:075640 (posted 18-Sep-2011 07:56:40 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
Publication Info: An extended abstract appeared in TCC 2011; this is the full version.
20140612:074437 (posted 12-Jun-2014 07:44:37 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
Publication Info: An extended abstract appeared in TCC 2011; this is the full version.
20140612:074531 (posted 12-Jun-2014 07:45:31 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
Publication Info: An extended abstract appeared in TCC 2011; this is the full version.
20140612:085734 (posted 12-Jun-2014 08:57:34 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
Publication Info: An extended abstract appeared in TCC 2011; this is the full version.
20141029:084648 (posted 29-Oct-2014 08:46:48 UTC)
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell and Benny Pinkas
Original publication (with minor differences): IACR-JOC-2012
[
Cryptology ePrint archive
]