Oblivious parallel RAM and applications

Elette Boyle, Kai Min Chung, Rafael Pass

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We initiate the study of cryptography for parallel RAM (PRAM) programs. The PRAM model captures modern multi-core architectures and cluster computing models, where several processors execute in parallel and make accesses to shared memory, and provides the “best of both” circuit and RAM models, supporting both cheap random access and parallelism. We propose and attain the notion of Oblivious PRAM. We present a compiler taking any PRAM into one whose distribution of memory accesses is statistically independent of the data (with negligible error), while only incurring a polylogarithmic slowdown (in both total and parallel complexity). We discuss applications of such a compiler, building upon recent advances relying on Oblivious (sequential) RAM (Goldreich Ostrovsky JACM’12). In particular, we demonstrate the construction of a garbled PRAM compiler based on an OPRAM compiler and secure identity-based encryption.

Original languageEnglish
Title of host publicationTheory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings
EditorsEyal Kushilevitz, Tal Malkin
Pages175-204
Number of pages30
DOIs
StatePublished - 2016
Externally publishedYes
Event13th International Conference on Theory of Cryptography, TCC 2016 - Tel Aviv, Israel
Duration: 10 Jan 201613 Jan 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9563

Conference

Conference13th International Conference on Theory of Cryptography, TCC 2016
Country/TerritoryIsrael
CityTel Aviv
Period10/01/1613/01/16

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Oblivious parallel RAM and applications'. Together they form a unique fingerprint.

Cite this