Cryptology ePrint Archive: Report 2012/512

Available versions in chronological order

20120903:131152 (posted 03-Sep-2012 13:11:52 UTC): Constant-Overhead Secure Computation for Boolean Circuits in the Preprocessing Model; Ivan Damgard and Sarah Zakarias
20120919:071216 (posted 19-Sep-2012 07:12:16 UTC): Constant-Overhead Secure Computation for Boolean Circuits in the Preprocessing Model; Ivan Damgard and Sarah Zakarias
20120919:075247 (posted 19-Sep-2012 07:52:47 UTC): Constant-Overhead Secure Computation for Boolean Circuits in the Preprocessing Model; Ivan Damgard and Sarah Zakarias
20121221:133741 (posted 21-Dec-2012 13:37:41 UTC): Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing; Ivan Damgard and Sarah Zakarias
20121221:134502 (posted 21-Dec-2012 13:45:02 UTC): Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing; Ivan Damgard and Sarah Zakarias
20121222:115042 (posted 22-Dec-2012 11:50:42 UTC): Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing; Ivan Damgard and Sarah Zakarias
20130215:161535 (posted 15-Feb-2013 16:15:35 UTC): Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing; Ivan Damgard and Sarah Zakarias
20130215:163353 (posted 15-Feb-2013 16:33:53 UTC): Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing; Ivan Damgard and Sarah Zakarias
20130301:231226 (posted 01-Mar-2013 23:12:26 UTC): Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing; Ivan Damgard and Sarah Zakarias
20130301:231359 (posted 01-Mar-2013 23:13:59 UTC): Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing; Ivan Damgard and Sarah Zakarias

[ Cryptology ePrint archive ]