Name
Title | ||
|---|---|---|
On the practical importance of communication complexity for secure multi-party computation protocols |
Abstract | ||
|---|---|---|
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental study of a specific protocol for a real-world sized problem under realistic conditions and it suggests that the practical performance of the protocol is almost independent of the network performance. We argue that our result can be generalized to a whole class of SMC protocols. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1529282.1529730 | SAC |
Keywords | Field | DocType |
specific protocol,practical importance,smc protocol,realistic condition,whole class,experimental study,network performance,practical performance,communication complexity,secure multi-party computation,secure multi-party computation protocol,synchronization,performance measurement,secure multi party computation | Secure multi-party computation,Synchronization,Computer science,Computer network,Communication complexity,Performance measurement,Secure two-party computation,Computation,Network performance,Universal composability,Distributed computing | Conference |
Citations | PageRank | References |
16 | 0.95 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florian Kerschbaum | 1 | 1186 | 89.43 |
| Daniel Dahlmeier | 2 | 460 | 29.67 |
| Axel Schröpfer | 3 | 67 | 4.90 |
| Debmalya Biswas | 4 | 106 | 13.43 |