Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data

Authors:
Michael T. Goodrich
Affiliations:
Univ. of California, Irvine, Irvine, CA, USA
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 20
Cited 4

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The input/output complexity of sorting and related problems

Communications of the ACM
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Software protection and simulation on oblivious RAMs

Journal of the ACM (JACM)
Fast randomized parallel methods for planar convex hull construction

Computational Geometry: Theory and Applications
Hypercubic Sorting Networks

SIAM Journal on Computing
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
External-Memory Breadth-First Search with Sublinear I/O

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Cache-Oblivious B-Trees

SIAM Journal on Computing
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters

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

ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Side-Channel Leaks in Web Applications: A Reality Today, a Challenge Tomorrow

SP '10 Proceedings of the 2010 IEEE Symposium on Security and Privacy
Randomized Shellsort: a simple oblivious sorting algorithm

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters

IEEE Transactions on Knowledge and Data Engineering
Oblivious vs. distribution-based sorting: an experimental evaluation

ESA'05 Proceedings of the 13th annual European conference on Algorithms

An energy complexity model for algorithms

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Memory access pattern protection for resource-constrained devices

CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
Data-oblivious graph algorithms for secure computation and outsourcing

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Privacy-preserving matrix factorization

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present data-oblivious algorithms in the external-memory model for compaction, selection, and sorting. Motivation for such problems comes from clients who use outsourced data storage services and wish to mask their data access patterns. We show that compaction and selection can be done data-obliviously using O(N/B) I/Os, and sorting can be done, with a high probability of success, using O(N/B) logM/B(N/B)) I/Os.