Oblivious parallel RAM and applications

Elette Boyle; Kai Min Chung; Rafael Pass

doi:10.1007/978-3-662-49099-0_7

Oblivious parallel RAM and applications

Elette Boyle
, Kai Min Chung
, Rafael Pass

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings
Editors	Eyal Kushilevitz, Tal Malkin
Publisher	Springer Verlag
Pages	175-204
Number of pages	30
ISBN (Print)	9783662490983
DOIs	https://doi.org/10.1007/978-3-662-49099-0_7
State	Published - 2016
Externally published	Yes
Event	13th International Conference on Theory of Cryptography, TCC 2016-B - Tel Aviv, Israel Duration: 10 Jan 2016 → 13 Jan 2016

Publication series

Name	Lecture Notes in Computer Science
Volume	9563

Conference

Conference	13th International Conference on Theory of Cryptography, TCC 2016-B
Country/Territory	Israel
City	Tel Aviv
Period	10/01/16 → 13/01/16

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-49099-0_7

Cite this

@inproceedings{d1872ebe6f3742ebb61839b433e89e9c,

title = "Oblivious parallel RAM and applications",

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{\textquoteright}12). In particular, we demonstrate the construction of a garbled PRAM compiler based on an OPRAM compiler and secure identity-based encryption.",

author = "Elette Boyle and Chung, \{Kai Min\} and Rafael Pass",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2016.; 13th International Conference on Theory of Cryptography, TCC 2016-B ; Conference date: 10-01-2016 Through 13-01-2016",

year = "2016",

doi = "10.1007/978-3-662-49099-0\_7",

language = "English",

isbn = "9783662490983",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "175--204",

editor = "Eyal Kushilevitz and Tal Malkin",

booktitle = "Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings",

address = "Germany",

}

Boyle, E, Chung, KM & Pass, R 2016, Oblivious parallel RAM and applications. in E Kushilevitz & T Malkin (eds), Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings. Lecture Notes in Computer Science, vol. 9563, Springer Verlag, pp. 175-204, 13th International Conference on Theory of Cryptography, TCC 2016-B, Tel Aviv, Israel, 10/01/16. https://doi.org/10.1007/978-3-662-49099-0_7

Oblivious parallel RAM and applications. / Boyle, Elette; Chung, Kai Min; Pass, Rafael.
Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings. ed. / Eyal Kushilevitz; Tal Malkin. Springer Verlag, 2016. p. 175-204 (Lecture Notes in Computer Science; Vol. 9563).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Oblivious parallel RAM and applications

AU - Boyle, Elette

AU - Chung, Kai Min

AU - Pass, Rafael

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84954118326

U2 - 10.1007/978-3-662-49099-0_7

DO - 10.1007/978-3-662-49099-0_7

M3 - Conference contribution

SN - 9783662490983

T3 - Lecture Notes in Computer Science

SP - 175

EP - 204

BT - Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings

A2 - Kushilevitz, Eyal

A2 - Malkin, Tal

PB - Springer Verlag

T2 - 13th International Conference on Theory of Cryptography, TCC 2016-B

Y2 - 10 January 2016 through 13 January 2016

ER -

Oblivious parallel RAM and applications

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this