Secure Multi-Party Sorting and Applications

by Kristján Valur Jónsson, Gunnar Kreitz, and Misbah Uddin

Presented at Applied Cryptography and Network Security (ACNS) 2011, Industrial Track

Abstract

Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing a secure multi-party computing (MPC) protocol for sorting, building on previous results in the field of sorting networks.

Apart from the immediate uses for sorting, our protocol can be used as a building-block in more complex algorithms. We present a weighted set intersection algorithm, where each party inputs a set of weighted elements and the output consists of the input elements with their weights summed. As a practical example, we apply our protocols in a network security setting for aggregation of security incident reports from multiple reporters, specifically to detect stealthy port scans in a distributed but privacy preserving manner. Both sorting and weighted set intersection use $\Ordo{n \log^2 n}$ comparisons in $\Ordo{\log^2 n}$ rounds with practical constants.

Our protocols can be built upon any secret sharing scheme supporting multiplication and addition. We have implemented and evaluated the performance of sorting on the Sharemind secure multi-party computation platform, demonstrating the real-world performance of our proposed protocols.

Download

• Article. Also available as Cryptology ePrint Archive, Report 2011/122.
• Slides from ACNS 2011 (minor errors corrected since conference)

Copyright

This paper has been published on this web site under a Creative Commons license.

Secure Multi-Party Sorting and Applications by Kristján Valur Jónsson, Gunnar Kreitz, and Misbah Uddin is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.