FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM
Author:
Affiliation:
1. Bar-Ilan University, Ramat Gan, Israel
2. Hebrew University & NTT Research, Jerusalem, Israel
Funder
BSF-NSF
ISRAEL SCIENCE FOUNDATION
European Union?s Horizon 2020 research and innovation programme
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3576915.3623125
Reference49 articles.
1. Miklós Ajtai János Komlós and Endre Szemeré di. 1983. An O(n log n) Sorting Network. In STOC. 1--9.
2. Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2020. Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA 2020. SIAM, 8--14.
3. OptORAMa: Optimal Oblivious RAM
4. Gilad Asharov Ilan Komargodski Wei-Kai Lin Enoch Peserico and Elaine Shi. 2022. Optimal Oblivious Parallel RAM. In SODA. 2459--2521.
5. Gilad Asharov Ilan Komargodski Wei-Kai Lin and Elaine Shi. 2021. Oblivious RAM with Worst-Case Logarithmic Overhead. In Advances in Cryptology - CRYPTO. 610--640.
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3