搜索结果: 1-3 共查到“军事学 Modulo Reduction”相关记录3条 . 查询时间(0.048 秒)
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
Secure Computation / Multi-party Computation Constant-Rounds Linear Exponentiation Modulo Reduction Bit-Decomposition
2012/3/29
Bit-decomposition is an important primitive in multi-party computation (MPC). Given a sharing of secret $x$, it allows the parties to compute the sharings of the bits of $x$ in constant rounds. With t...
Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction
Multi-party Computation Constant-Rounds Linear Exponentiation Modulo Reduction Bit-Decomposition
2011/2/23
In a recent work, Ning and Xu proposed a generalization of bit-decomposition which can, given a sharing of secret $a$ and an integer $m \ge 2$, compute the sharings (or bitwise sharings) of the base-$...
Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
foundations Multiparty Computation Constant Rounds Secret Sharing Bitwise Sharing Digit-wise Sharing
2010/7/13
Bit-decomposition, which is proposed by Damg{\aa}rd \emph{et al.}, is a powerful tool for multi-party computation (MPC). Given a sharing of secret \emph{a}, it allows the parties to compute the sharin...