Deterministic, Stash-Free Write-Only ORAM
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
摘要
Write-Only Oblivious RAM (WoORAM) protocols provide privacy by encrypting the contents of data and also hiding the pattern of write operations over that data. WoORAMs provide better privacy than plain encryption and better performance than more general ORAM schemes (which hide both writing and reading access patterns), and the write-oblivious setting has been applied to important applications of cloud storage synchronization and encrypted hidden volumes. In this paper, we introduce an entirely new technique for Write-Only ORAM, called DetWoORAM. Unlike previous solutions, DetWoORAM uses a deterministic, sequential writing pattern without the need for any "stashing" of blocks in local state when writes fail. Our protocol, while conceptually simple, provides substantial improvement over prior solutions, both asymptotically and experimentally. In particular, under typical settings the DetWoORAM writes only 2 blocks (sequentially) to backend memory for each block written to the device, which is optimal. We have implemented our solution using the BUSE (block device in user-space) module and tested DetWoORAM against both an encryption only baseline of dm-crypt and prior, randomized WoORAM solutions, measuring only a 3x-14x slowdown compared to an encryption-only baseline and around 6x-19x speedup compared to prior work. This paper is authored by an employee(s) of the United States Government and is in the public domain. Non-exclusive copying or redistribution is allowed, provided that the article citation is given and the authors and agency are clearly identified as its source.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- rORAM: Efficient Range ORAM with O(log2 N) LocalityAnrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry 等NDSS 2019 · 被引用 20 次
- BurnBox: Self-Revocable Encryption in a World Of Compelled AccessNirvan Tyagi, Muhammad Haris Mughees, Thomas Ristenpart, Ian MiersUSENIX Security 2018 · 被引用 10 次
- Shufflecake: Plausible Deniability for Multiple Hidden Filesystems on LinuxElia Anzuoni, Tommaso GagliardoniCCS 2023 · 被引用 4 次
- MACAO: A Maliciously-Secure and Client-Efficient Active ORAM FrameworkThang Hoang, Jorge Guajardo, Attila A. YavuzNDSS 2020
- Titanium: A Metadata-Hiding File-Sharing System with Malicious SecurityWeikeng Chen, Thang Hoang, Jorge Guajardo, Attila A. YavuzNDSS 2022
它引用的顶会 Paper6
- Revisiting Square-Root ORAM: Efficient Random Access in Multi-party ComputationSamee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón 等S&P 2016 · 被引用 124 次
- TaoStore: Overcoming Asynchronicity in Oblivious Data StorageCetin Sahin, Victor Zakhary, Amr El Abbadi, Huijia Lin 等S&P 2016 · 被引用 98 次
- A Practical Oblivious Map Data Structure with Secure Deletion and History IndependenceDaniel S. Roche, Adam J. Aviv, Seung Geol ChoiS&P 2016 · 被引用 63 次
- HOP: Hardware makes Obfuscation PracticalKartik Nayak, Christopher W. Fletcher, Ling Ren, Nishanth Chandran 等NDSS 2017 · 被引用 54 次
- OblivP2P: An Oblivious Peer-to-Peer Content Sharing SystemYaoqi Jia, Tarik Moataz, Shruti Tople, Prateek SaxenaUSENIX Security 2016 · 被引用 19 次
相关 Paper
- ObliviSync: Practical Oblivious File Backup and SynchronizationAdam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. RocheNDSS 2017 · 被引用 13 次
- DuetORAM: Two-Server Distributed ORAM with Constant Rounds and O(log N) CommunicationFeng Li, Xiangfu Song, Yingying Li, Lisha Yao 等USENIX Security 2026
- FutORAMa: A Concretely Efficient Hierarchical Oblivious RAMGilad Asharov, Ilan Komargodski, Yehuda MichelsonCCS 2023 · 被引用 7 次
- QuORAM: A Quorum-Replicated Fault Tolerant ORAM DatastoreSujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal 等USENIX Security 2022
- Bulkor: Enabling Bulk Loading for Path ORAMXiang Li, Yunqian Luo, Mingyu GaoS&P 2024 · 被引用 8 次
