Cryptology ePrint Archive: Report 2011/069
Available versions in chronological order
20110214:141756 (posted 14-Feb-2011 14:17:56 UTC)
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction
Chao Ning and Qiuliang Xu
20110214:181008 (posted 14-Feb-2011 18:10:08 UTC)
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction
Chao Ning and Qiuliang Xu
20110218:120103 (posted 18-Feb-2011 12:01:03 UTC)
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction
Chao Ning and Qiuliang Xu
20110308:133740 (posted 08-Mar-2011 13:37:40 UTC)
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction
Chao Ning and Qiuliang Xu
20110823:085720 (posted 23-Aug-2011 08:57:20 UTC)
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
Chao Ning and Qiuliang Xu
[
Cryptology ePrint archive
]