Cryptology ePrint Archive: Report 2010/266

Available versions in chronological order


Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu

Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu

Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu
Publication Info: AsiaCrypt 2010. LNCS, vol 6477, pp. 483-500. Springer, Heidelberg (2010)

Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu
Publication Info: AsiaCrypt 2010. LNCS, vol 6477, pp. 483-500. Springer, Heidelberg (2010)

Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu
Publication Info: AsiaCrypt 2010. LNCS, vol 6477, pp. 483-500. Springer, Heidelberg (2010)

Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu
Publication Info: AsiaCrypt 2010. LNCS, vol 6477, pp. 483-500. Springer, Heidelberg (2010)

Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu
Publication Info: AsiaCrypt 2010. LNCS, vol 6477, pp. 483-500. Springer, Heidelberg (2010)

Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu
Publication Info: AsiaCrypt 2010. LNCS, vol 6477, pp. 483-500. Springer, Heidelberg (2010)

Multiparty Computation for Modulo Reduction without Bit-Decomposition and A Generalization to Bit-Decomposition
Chao Ning and Qiuliang Xu
Publication Info: AsiaCrypt 2010. LNCS, vol 6477, pp. 483-500. Springer, Heidelberg (2010)


[ Cryptology ePrint archive ]