On the practical importance of communication complexity for secure multi-party computation protocols

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. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems—distributed applications; D.4.6 [Operating Systems]: Security and Protection—Cryptographic controls General Terms Security, Experimentation, Performance, Measurement Keywords Secure Multi-Party Computation, Experimentation, Performance Measurement, Synchronization

• Type: Conference
• Year: 2009
• Where: SAC
• Authors: Florian Kerschbaum, Daniel Dahlmeier, Axel Schröpfer, Debmalya Biswas
• Keywords: Applied Computing, Many Advancements, Real-world Sized Problem, SAC 2009, Secure Multi-party Computation