Cryptology ePrint Archive: Report 2013/099
Available versions in chronological order
20130227:162924 (posted 27-Feb-2013 16:29:24 UTC)
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer
Samuel Ranellucci and Alain Tapp
20130918:105850 (posted 18-Sep-2013 10:58:50 UTC)
Constant-Round Secure Two-Party Computation from a linear number of O
Samuel Ranellucci and Alain Tapp
20130918:111023 (posted 18-Sep-2013 11:10:23 UTC)
Constant-round secure two-party computation from a linear number of oblivious transfer
Samuel Ranellucci and Alain Tapp
20130918:112104 (posted 18-Sep-2013 11:21:04 UTC)
Constant-round secure two-party computation from a linear number of oblivious transfer
Samuel Ranellucci and Alain Tapp
[
Cryptology ePrint archive
]