Asymptotically Tight Bounds for Composing ORAM with PIR-Reference-Cited by-同舟云学术

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

Asymptotically Tight Bounds for Composing ORAM with PIR

Published:2017 Issue: Volume: Page:91-120
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abraham Ittai,Fletcher Christopher W.,Nayak Kartik,Pinkas Benny,Ren Ling

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-54365-8_5

Reference62 articles.

1. Ajtai, M.: Oblivious RAMs without cryptogrpahic assumptions. In: Proceedings of the forty-second ACM symposium on Theory of computing, pp. 181–190. ACM (2010)

2. Lecture Notes in Computer Science;D Apon,2014

3. 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 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 837–849. ACM (2015)

4. Lecture Notes in Computer Science;E Boyle,2016

5. Boyle, E., Naor, M.: Is there an oblivious RAM lower bound? In: Proceedings of the ACM Conference on Innovations in Theoretical Computer Science, pp. 357–368. ACM (2016)

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

1. Efficient Actively Secure DPF and RAM-based 2PC with One-Bit Leakage;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

2. Privacy-Preserving Dijkstra;Lecture Notes in Computer Science;2024

3. Distributed Oblivious RAM;Encyclopedia of Cryptography, Security and Privacy;2023

4. MacORAMa: Optimal Oblivious RAM with Integrity;Advances in Cryptology – CRYPTO 2023;2023

5. LPS-ORAM: Perfectly Secure Oblivious RAM with Logarithmic Bandwidth Overhead;Security and Communication Networks;2022-08-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3