Usable and Efficient Secure Multiparty Computation

We have published a new paper on how to securely use sorting methods with secure multi-party computation technology. The paper "A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation" published in NordSec'14 considers three main sorting methods: comparison-based sorting methods (eg. quicksort), radix sort and sorting networks for obliviously sorting vectors and matrices. The main focus of the paper is the analysis of benchmarking results.