562 search results - page 3 / 113 » Secure Multiparty Computation with General Interaction Patte... |
128
Voted
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
15 years 10 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
114
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
131
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
120
Voted
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
138
Voted
CRYPTO
2004
Springer
15 years 9 months ago
2004
Springer
Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional i...