Practically efficient multi-party sorting protocols from comparison sort algorithms

Authors:
Koki Hamada;Ryo Kikuchi;Dai Ikarashi;Koji Chida;Katsumi Takahashi
Affiliations:
NTT Secure Platform Laboratories, NTT Corporation, Musashino-shi, Tokyo, Japan;NTT Secure Platform Laboratories, NTT Corporation, Musashino-shi, Tokyo, Japan;NTT Secure Platform Laboratories, NTT Corporation, Musashino-shi, Tokyo, Japan;NTT Secure Platform Laboratories, NTT Corporation, Musashino-shi, Tokyo, Japan;NTT Secure Platform Laboratories, NTT Corporation, Musashino-shi, Tokyo, Japan
Venue:
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Year:
2012

Citing 28
Cited 1

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Proceedings of the twentieth annual ACM symposium on Theory of computing

STOC'88 1988 Symposium on the Theory of Computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
How to share a secret

Communications of the ACM
Algorithm 65: find

Communications of the ACM
Introduction to algorithms

Introduction to algorithms
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Fairplay—a secure two-party computation system

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
The Algorithm Design Manual

The Algorithm Design Manual
FairplayMP: a system for secure multi-party computation

Proceedings of the 15th ACM conference on Computer and communications security
Sharemind: A Framework for Fast Privacy-Preserving Computations

ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Time bounds for selection

Journal of Computer and System Sciences
Optimum secret sharing scheme secure against cheating

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Bureaucratic protocols for secure two-party sorting, selection, and permuting

ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
TASTY: tool for automating secure two-party computations

Proceedings of the 17th ACM conference on Computer and communications security
Randomized Shellsort: a simple oblivious sorting algorithm

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SEPIA: privacy-preserving aggregation of multi-domain network events and statistics

USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Perfectly secure oblivious RAM without random oracles

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Generic constant-round oblivious sorting algorithm for MPC

ProvSec'11 Proceedings of the 5th international conference on Provable security
Round-efficient oblivious database manipulation

ISC'11 Proceedings of the 14th international conference on Information security
Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Constant-round multiparty computation using a black-box pseudorandom generator

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Privacy-preserving matrix factorization

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorting is one of the most important primitives in various systems, for example, database systems, since it is often the dominant operation in the running time of an entire system. Therefore, there is a long list of work on improving its efficiency. It is also true in the context of secure multi-party computation (MPC), and several MPC sorting protocols have been proposed. However, all existing MPC sorting protocols are based on less efficient sorting algorithms, and the resultant protocols are also inefficient. This is because only a method for converting data-oblivious algorithms to corresponding MPC protocols is known, despite the fact that most efficient sorting algorithms such as quicksort and merge sort are not data-oblivious. We propose a simple and general approach of converting non-data-oblivious comparison sort algorithms, which include the above algorithms, into corresponding MPC protocols. We then construct an MPC sorting protocol from the well known efficient sorting algorithm, quicksort, with our approach. The resultant protocol is practically efficient since it significantly improved the running time compared to existing protocols in experiments.