Anonymous RAM

Michael Backes; Amir Herzberg; Aniket Kate; Ivan Pryvalov

doi:10.1007/978-3-319-45744-4_17

Anonymous RAM

Michael Backes, Amir Herzberg, Aniket Kate, Ivan Pryvalov

Department of Computer Science

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

9 Scopus citations

Abstract

We define the concept of and present provably secure constructions for Anonymous RAM (AnonRAM), a novel multi-user storage primitive that offers strong privacy and integrity guarantees. AnonRAM combines privacy features of anonymous communication and oblivious RAM (ORAM) schemes, allowing it to protect, simultaneously, the privacy of content, access patterns and user’s identity, from curious servers and from other (even adversarial) users. AnonRAM further protects integrity, i.e., it prevents malicious users from corrupting data of other users. We present two secure AnonRAM schemes, differing in design and time complexity. The first scheme has a simpler design; like efficient ORAM schemes, its time complexity is poly-logarithmic in the number of cells (per user); however, it is linear in the number of users. The second AnonRAM scheme reduces the overall complexity to poly-logarithmic in the total number of cells (of all users) at the cost of requiring two (non-colluding) servers.

Original language	English
Title of host publication	Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings
Editors	Sokratis Katsikas, Catherine Meadows, Ioannis Askoxylakis, Sotiris Ioannidis
Publisher	Springer Verlag
Pages	344-362
Number of pages	19
ISBN (Print)	9783319457437
DOIs	https://doi.org/10.1007/978-3-319-45744-4_17
State	Published - 2016
Event	21st European Symposium on Research in Computer Security, ESORICS 2016 - Heraklion, Greece Duration: 26 Sep 2016 → 30 Sep 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9878 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st European Symposium on Research in Computer Security, ESORICS 2016
Country/Territory	Greece
City	Heraklion
Period	26/09/16 → 30/09/16

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2016.

Funding

We thank the anonymous reviewers for their valuable comments. This work was supported by the German Federal Ministry for Education and Research (BMBF) through funding for the Center for IT-Security, Privacy and Accountability (CISPA) and by a grant from the Israeli Ministry of Science and Technology.

Funders	Funder number
Bundesministerium für Bildung und Forschung
Ministry of science and technology, Israel

Keywords

(Universal) re-randomizable encryption
Access privacy
Anonymity
Oblivious PRF
Oblivious RAM
Outsourced data

Access to Document

10.1007/978-3-319-45744-4_17

Cite this

Backes, M., Herzberg, A., Kate, A., & Pryvalov, I. (2016). Anonymous RAM. In S. Katsikas, C. Meadows, I. Askoxylakis, & S. Ioannidis (Eds.), Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings (pp. 344-362). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9878 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-45744-4_17

Backes, Michael ; Herzberg, Amir ; Kate, Aniket et al. / Anonymous RAM. Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings. editor / Sokratis Katsikas ; Catherine Meadows ; Ioannis Askoxylakis ; Sotiris Ioannidis. Springer Verlag, 2016. pp. 344-362 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{961892d8050144a48ed4bd9d42f941f0,

title = "Anonymous RAM",

abstract = "We define the concept of and present provably secure constructions for Anonymous RAM (AnonRAM), a novel multi-user storage primitive that offers strong privacy and integrity guarantees. AnonRAM combines privacy features of anonymous communication and oblivious RAM (ORAM) schemes, allowing it to protect, simultaneously, the privacy of content, access patterns and user{\textquoteright}s identity, from curious servers and from other (even adversarial) users. AnonRAM further protects integrity, i.e., it prevents malicious users from corrupting data of other users. We present two secure AnonRAM schemes, differing in design and time complexity. The first scheme has a simpler design; like efficient ORAM schemes, its time complexity is poly-logarithmic in the number of cells (per user); however, it is linear in the number of users. The second AnonRAM scheme reduces the overall complexity to poly-logarithmic in the total number of cells (of all users) at the cost of requiring two (non-colluding) servers.",

keywords = "(Universal) re-randomizable encryption, Access privacy, Anonymity, Oblivious PRF, Oblivious RAM, Outsourced data",

author = "Michael Backes and Amir Herzberg and Aniket Kate and Ivan Pryvalov",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 21st European Symposium on Research in Computer Security, ESORICS 2016 ; Conference date: 26-09-2016 Through 30-09-2016",

year = "2016",

doi = "10.1007/978-3-319-45744-4_17",

language = "אנגלית",

isbn = "9783319457437",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "344--362",

editor = "Sokratis Katsikas and Catherine Meadows and Ioannis Askoxylakis and Sotiris Ioannidis",

booktitle = "Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings",

address = "גרמניה",

}

Backes, M, Herzberg, A, Kate, A & Pryvalov, I 2016, Anonymous RAM. in S Katsikas, C Meadows, I Askoxylakis & S Ioannidis (eds), Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9878 LNCS, Springer Verlag, pp. 344-362, 21st European Symposium on Research in Computer Security, ESORICS 2016, Heraklion, Greece, 26/09/16. https://doi.org/10.1007/978-3-319-45744-4_17

Anonymous RAM. / Backes, Michael; Herzberg, Amir; Kate, Aniket et al.
Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings. ed. / Sokratis Katsikas; Catherine Meadows; Ioannis Askoxylakis; Sotiris Ioannidis. Springer Verlag, 2016. p. 344-362 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9878 LNCS).

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

TY - GEN

T1 - Anonymous RAM

AU - Backes, Michael

AU - Herzberg, Amir

AU - Kate, Aniket

AU - Pryvalov, Ivan

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - We define the concept of and present provably secure constructions for Anonymous RAM (AnonRAM), a novel multi-user storage primitive that offers strong privacy and integrity guarantees. AnonRAM combines privacy features of anonymous communication and oblivious RAM (ORAM) schemes, allowing it to protect, simultaneously, the privacy of content, access patterns and user’s identity, from curious servers and from other (even adversarial) users. AnonRAM further protects integrity, i.e., it prevents malicious users from corrupting data of other users. We present two secure AnonRAM schemes, differing in design and time complexity. The first scheme has a simpler design; like efficient ORAM schemes, its time complexity is poly-logarithmic in the number of cells (per user); however, it is linear in the number of users. The second AnonRAM scheme reduces the overall complexity to poly-logarithmic in the total number of cells (of all users) at the cost of requiring two (non-colluding) servers.

AB - We define the concept of and present provably secure constructions for Anonymous RAM (AnonRAM), a novel multi-user storage primitive that offers strong privacy and integrity guarantees. AnonRAM combines privacy features of anonymous communication and oblivious RAM (ORAM) schemes, allowing it to protect, simultaneously, the privacy of content, access patterns and user’s identity, from curious servers and from other (even adversarial) users. AnonRAM further protects integrity, i.e., it prevents malicious users from corrupting data of other users. We present two secure AnonRAM schemes, differing in design and time complexity. The first scheme has a simpler design; like efficient ORAM schemes, its time complexity is poly-logarithmic in the number of cells (per user); however, it is linear in the number of users. The second AnonRAM scheme reduces the overall complexity to poly-logarithmic in the total number of cells (of all users) at the cost of requiring two (non-colluding) servers.

KW - (Universal) re-randomizable encryption

KW - Access privacy

KW - Anonymity

KW - Oblivious PRF

KW - Oblivious RAM

KW - Outsourced data

UR - http://www.scopus.com/inward/record.url?scp=84990031906&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-45744-4_17

DO - 10.1007/978-3-319-45744-4_17

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84990031906

SN - 9783319457437

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 344

EP - 362

BT - Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings

A2 - Katsikas, Sokratis

A2 - Meadows, Catherine

A2 - Askoxylakis, Ioannis

A2 - Ioannidis, Sotiris

PB - Springer Verlag

T2 - 21st European Symposium on Research in Computer Security, ESORICS 2016

Y2 - 26 September 2016 through 30 September 2016

ER -

Backes M, Herzberg A, Kate A, Pryvalov I. Anonymous RAM. In Katsikas S, Meadows C, Askoxylakis I, Ioannidis S, editors, Computer Security - 21st European Symposium on Research in Computer Security, ESORICS 2016, Proceedings. Springer Verlag. 2016. p. 344-362. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-45744-4_17

Anonymous RAM

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this