Stronger Lower Bounds for Online ORAM

Kód výsledku v 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>
Výsledek na webu
<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>

Jazyk výsledku
angličtina
Název v původním jazyce
Stronger Lower Bounds for Online ORAM
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Stronger Lower Bounds for Online ORAM
Popis výsledku anglicky
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.

Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
<a href="/cs/project/GX19-27871X" target="_blank" >GX19-27871X: Efektivní aproximační algoritmy a obvodová složitost</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2019
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)