Bureaucratic protocols for secure two-party sorting, selection, and permuting

Authors:
Guan Wang;Tongbo Luo;Michael T. Goodrich;Wenliang Du;Zutao Zhu
Affiliations:
Syracuse University, Syracuse, NY;Syracuse University, Syracuse, NY;University of California, Irvine, CA;Syracuse University, Syracuse, NY;Syracuse University, Syracuse, NY
Venue:
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Year:
2010

Citing 16
Cited 5

A study of the worst-case of shell-sort

A study of the worst-case of shell-sort
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Sorting in c log n parallel steps

Combinatorica
On probabilistic networks for selection, merging, and sorting

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A high-speed sorting procedure

Communications of the ACM
Selective private function evaluation with applications to private statistics

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Analyzing variants of Shellsort

Information Processing Letters
Introduction to Algorithms

Introduction to Algorithms
Analysis of Shellsort and Related Algorithms

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Private information retrieval

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Randomized Shellsort: a simple oblivious sorting algorithm

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Privacy-preserving data-oblivious geometric algorithms for geographic data

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Privacy-preserving group data access via stateless oblivious RAM simulation

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Practically efficient multi-party sorting protocols from comparison sort algorithms

ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Privacy-preserving matrix factorization

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P computations for sorting, selection, and random permutation. In a nutshell, the main idea behind bureaucratic computing is to design data-oblivious algorithms that push all knowledge and influence of input values down to small black-box circuits, which are simulated using Yao's garbled paradigm. The practical benefit of this approach is that it maintains the zero-knowledge features of secure two-party computations while avoiding the significant computational overheads that come from trying to apply Yao's garbled paradigm to anything other than simple two-input functions.