A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation

Conference paper

DOI: 10.1007/978-3-319-11599-3_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8788)
Cite this paper as:
Bogdanov D., Laur S., Talviste R. (2014) A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation. In: Bernsmed K., Fischer-Hübner S. (eds) Secure IT Systems. NordSec 2014. Lecture Notes in Computer Science, vol 8788. Springer, Cham

Abstract

Cryptographic secure computing methods like secure multi-party computation, circuit garbling and homomorphic encryption are becoming practical enough to be usable in applications. Such applications need special data-independent sorting algorithms to preserve privacy. In this paper, we describe the design and implementation of four different oblivious sorting algorithms. We improve two earlier designs based on sorting networks and quicksort with the capability of sorting matrices. We also propose two new designs—a naive comparison-based sort with a low round count and an oblivious radix sort algorithm that does not require any private comparisons. For all these algorithms, we present thorough complexity and performance analysis including detailed breakdown of running-time, network and memory usage.

Keywords

privacy algorithms sorting implementation performance analysis secure multi-party computation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.CyberneticaTallinnEstonia
  2. 2.Institute of Computer ScienceUniversity of TartuTartuEstonia

Personalised recommendations