Is There an Oblivious RAM Lower Bound?-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Is There an Oblivious RAM Lower Bound?

Published:2016-01-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
language:
Short-container-title:

Author:

Boyle Elette¹,Naor Moni²

Affiliation:

1. IDC Herzliya, Herzliya, Israel

2. Weizmann Institute of Science, Rehovot, Israel

Funder

ERC-CaC

Ministry of Science and Technology, Israel

Seventh Framework Programme

United States-Israel Binational Science Foundation

Israel Science Foundation

I-CORE Program

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2840728.2840761

Reference36 articles.

1. Oblivious RAMs without cryptogrpahic assumptions

2. An 0(n log n) sorting network

3. Sorting in linear time?

4. Making Branching Programs Oblivious Requires Superlogarithmic Overhead

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

1. Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns;Proceedings of the ACM on Management of Data;2023-12-08

2. Tianji: Securing a Practical Asynchronous Multi-User ORAM;IEEE Transactions on Dependable and Secure Computing;2023-11

3. Doquet: Differentially Oblivious Range and Join Queries with Private Data Structures;Proceedings of the VLDB Endowment;2023-09

4. Oblivious RAM Lower Bound;Encyclopedia of Cryptography, Security and Privacy;2023-07-28

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP