Cryptology ePrint Archive: Report 2013/745

Available versions in chronological order

20131117:013713 (posted 17-Nov-2013 01:37:13 UTC): Asynchronous MPC with t< n/2 Using Non-equivocation; Michael Backes, Fabian Bendun, Ashish Choudhury and Aniket Kate
20131117:145950 (posted 17-Nov-2013 14:59:50 UTC): Asynchronous MPC with t< n/2 Using Non-equivocation; Michael Backes, Fabian Bendun, Ashish Choudhury and Aniket Kate
20140217:074218 (posted 17-Feb-2014 07:42:18 UTC): Asynchronous MPC with t; Michael Backes and Fabian Bendun and Ashish Choudhury and Aniket Kate
20140217:074831 (posted 17-Feb-2014 07:48:31 UTC): Asynchronous MPC with $t; Michael Backes and Fabian Bendun and Ashish Choudhury and Aniket Kate
20140217:075007 (posted 17-Feb-2014 07:50:07 UTC): Asynchronous MPC with t < n/2 Using Non-equivocation; Michael Backes and Fabian Bendun and Ashish Choudhury and Aniket Kate
20140617:221841 (posted 17-Jun-2014 22:18:41 UTC): Asynchronous MPC with a Strict Honest Majority Using Non-equivocation; Michael Backes and Fabian Bendun and Ashish Choudhury and Aniket Kate; Original publication (with major differences): ACM PODC 2014

[ Cryptology ePrint archive ]