Stronger Lower Bounds for Online ORAM
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10403257" target="_blank" >RIV/00216208:11320/19:10403257 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-030-36033-7_10" target="_blank" >https://doi.org/10.1007/978-3-030-36033-7_10</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-36033-7_10" target="_blank" >10.1007/978-3-030-36033-7_10</a>
Alternative languages
Result language
angličtina
Original language name
Stronger Lower Bounds for Online ORAM
Original language description
Oblivious RAM (ORAM), introduced in the context of software protection by Goldreich and Ostrovsky [JACM'96], aims at obfuscating the memory access pattern induced by a RAM computation. Ideally, the memory access pattern of an ORAM should be independent of the data being processed. Since the work of Goldreich and Ostrovsky, it was believed that there is an inherent Omega(log n) bandwidth overhead in any ORAM working with memory of size n. Larsen and Nielsen [CRYPTO'18] were the first to give a general Omega(log n) lower bound for any online ORAM, i.e., an ORAM that must process its inputs in an online manner.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Theory of Cryptography Part II
ISBN
978-3-030-36032-0
ISSN
0302-9743
e-ISSN
—
Number of pages
21
Pages from-to
264-284
Publisher name
Springer International Publishing
Place of publication
Nuremberg
Event location
Nuremberg
Event date
Dec 1, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—