Cryptology ePrint Archive: Report 2013/099

Available versions in chronological order


Secure Two-Party Computation via Leaky Generalized Oblivious Transfer
Samuel Ranellucci and Alain Tapp

Constant-Round Secure Two-Party Computation from a linear number of O
Samuel Ranellucci and Alain Tapp

Constant-round secure two-party computation from a linear number of oblivious transfer
Samuel Ranellucci and Alain Tapp

Constant-round secure two-party computation from a linear number of oblivious transfer
Samuel Ranellucci and Alain Tapp


[ Cryptology ePrint archive ]