A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum
[chapter]
2014
Lecture Notes in Computer Science
One of research goals on multi-party computation (MPC) is to achieve both perfectly secure and efficient protocols for basic functions or operations (e.g., equality, comparison, bit decomposition, and modular exponentiation). Recently, for many basic operations, MPC protocols with constant rounds and linear communication cost (in the input size) are proposed. In this paper, we propose the first MPC protocol for prefix sum in general semigroups with constant 2d + 2dc rounds and almost linear O(l
doi:10.1007/978-3-319-06734-6_18
fatcat:2semie5mgbgs3dlqamwexcekly