Author:
Asharov Gilad,Komargodski Ilan,Lin Wei-Kai,Shi Elaine
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference46 articles.
1. Miklós Ajtai, János Komlós, and Endre Szemerédi. An $$O(n \log n)$$ sorting network. In STOC, pages 1–9, 1983.
2. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, and Elaine Shi. OptORAMa: optimal oblivious RAM. In EUROCRYPT, pages 403–432, 2020.
3. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi. Optimal oblivious parallel RAM. IACR ePrint Arch., 2020:1292, 2020.
4. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, and Elaine Shi. Oblivious RAM with worst-case logarithmic overhead. In Advances in Cryptology - CRYPTO, pages 610–640, 2021.
5. Vincent Bindschaedler, Muhammad Naveed, Xiaorui Pan, XiaoFeng Wang, and Yan Huang. Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward. In CCS, pages 837–849, 2015.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Memory Checking Requires Logarithmic Overhead;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. MacORAMa: Optimal Oblivious RAM with Integrity;Advances in Cryptology – CRYPTO 2023;2023