Oblivious RAM with Worst-Case Logarithmic Overhead-Reference-Cited by-同舟云学术

Oblivious RAM with Worst-Case Logarithmic Overhead

Published:2021 Issue: Volume: Page:610-640
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2021
language:
Short-container-title:

Author:

Asharov Gilad,Komargodski Ilan,Lin Wei-Kai,Shi Elaine

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-84259-8_21

Reference41 articles.

1. Ajtai, M., Komlós, J., Szemerédi, E.: An $$O(n \log n)$$ sorting network. In: ACM STOC, pp. 1–9 (1983)

2. Lecture Notes in Computer Science;G Asharov,2020

3. Asharov, G., Komargodski, I., Lin, W., Peserico, E., Shi, E.: Optimal oblivious parallel RAM. IACR ePrint Archive 2020, 1292 (2020)

4. Bindschaedler, V., Naveed, M., Pan, X., Wang, X., Huang, Y.: Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward. In: ACM CCS, pp. 837–849 (2015)

5. Boyle, E., Naor, M.: Is there an oblivious RAM lower bound? In: ITCS, pp. 357–368 (2016)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

2. Oblivious RAM with Worst-Case Logarithmic Overhead;Journal of Cryptology;2023-02-24

3. 3-Party Secure Computation for RAMs: Optimal and Concretely Efficient;Theory of Cryptography;2023

4. DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead;Theory of Cryptography;2023

5. Memory Checking for Parallel RAMs;Theory of Cryptography;2023