Stronger Lower Bounds for Online ORAM

Hubáček, Pavel; Koucký, Michal; Král, Karel; Slívová, Veronika

doi:10.1007/978-3-030-36033-7_10

Cited by 12 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Removing Read operations from traces is also preferable because an analogue of Lem. 2 will show that including will lead to a trace-oriented PD definition that is equivalent to ORAMs (instead of write-only ORAMs), thus suffering ORAMs' efficiency lower-bounds [5,20,22,27,47].…”

Section: Independence Of Storage Layersmentioning

confidence: 99%

See 1 more Smart Citation

SoK: Plausibly Deniable Storage

Chen

Liang

Cărbunar³

et al. 2022

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

Data privacy is critical in instilling trust and empowering the societal pacts of modern technology-driven democracies. Unfortunately it is under continuous attack by overreaching or outright oppressive governments, including some of the world’s oldest democracies. Increasingly-intrusive anti-encryption laws severely limit the ability of standard encryption to protect privacy. New defense mechanisms are needed. Plausible deniability (PD) is a powerful property, enabling users to hide the existence of sensitive information in a system under direct inspection by adversaries. Popular encrypted storage systems such as TrueCrypt and other research efforts have attempted to also provide plausible deniability. Unfortunately, these efforts have often operated under less well-defined assumptions and adversarial models. Careful analyses often uncover not only high overheads but also outright security compromise. Further, our understanding of adversaries, the underlying storage technologies, as well as the available plausible deniable solutions have evolved dramatically in the past two decades. The main goal of this work is to systematize this knowledge. It aims to: (1) identify key PD properties, requirements and approaches; (2) present a direly-needed unified framework for evaluating security and performance; (3) explore the challenges arising from the critical interplay between PD and modern system layered stacks; (4) propose a new “trace-oriented” PD paradigm, able to decouple security guarantees from the underlying systems and thus ensure a higher level of flexibility and security independent of the technology stack. This work is meant also as a trusted guide for system and security practitioners around the major challenges in understanding, designing and implementing plausible deniability into new or existing systems.

show abstract

Section: Independence Of Storage Layersmentioning

confidence: 99%

“…2. Thus, it will suffer from ORAMs' efficiency lower bound [5,20,22,27,47]. For example, HIVE [4] can be proven secure even if Read leaves traces; indeed, it employs this actively by explaining a hidden access as a public Read.…”

Section: Unified Definitionmentioning

confidence: 99%

SoK: Plausibly Deniable Storage

Chen

Liang

Cărbunar³

et al. 2022

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

show abstract

“…Removing Read operations from traces is also preferable because an analogue of Lem. 2 will show that including will lead to a traceoriented PD definition that is equivalent to ORAMs (instead of write-only ORAMs), thus suffering ORAMs' efficiency lower-bounds [20,5,27,47,22].…”

Section: Independence Of Storage Layersmentioning

confidence: 99%

“…suffer from ORAMs' efficiency lower bound [20,5,27,47,22]. For example, HIVE [4] can be proven secure even if Read leaves traces; indeed, it employs this actively by explaining a hidden access as a public Read.…”

Section: Unified Definitionmentioning

confidence: 99%

See 1 more Smart Citation

SoK: Plausibly Deniable Storage

Chen¹,

Liang²,

Cărbunar³

et al. 2021

Preprint

View full text Add to dashboard Cite

Data privacy is critical in instilling trust and empowering the societal pacts of modern technology-driven democracies. Unfortunately, it is under continuous attack by overreaching or outright oppressive governments, including some of the world's oldest democracies. Increasingly-intrusive anti-encryption laws severely limit the ability of standard encryption to protect privacy. New defense mechanisms are needed.Plausible deniability (PD) is a powerful property, enabling users to hide the existence of sensitive information in a system under direct inspection by adversaries. Popular encrypted storage systems such as TrueCrypt and other research efforts have attempted to also provide plausible deniability. Unfortunately, these efforts have often operated under less well-defined assumptions and adversarial models. Careful analyses often uncover not only high overheads but also outright security compromise. Further, our understanding of adversaries, the underlying storage technologies, as well as the available plausible deniable solutions have evolved dramatically in the past two decades. The main goal of this work is to systematize this knowledge. It aims to:1. identify key PD properties, requirements, and approaches; 2. present a direly-needed unified framework for evaluating security and performance; 3. explore the challenges arising from the critical interplay between PD and modern system layered stacks;4. propose a new "trace-oriented" PD paradigm, able to decouple security guarantees from the underlying systems and thus ensure a higher level of flexibility and security independent of the technology stack.This work is meant also as a trusted guide for system and security practitioners around the major challenges in understanding, designing, and implementing plausible deniability into new or existing systems.

show abstract