Onion Ring ORAM-Reference-Cited by-同舟云学术

Onion Ring ORAM

Published:2019-11-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Chen Hao¹,Chillotti Ilaria²,Ren Ling³

Affiliation:

1. Microsoft Research, Redmond, WA, USA

2. KU Leuven, Leuven, Belgium

3. University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA

Funder

FWO under an Odysseus project GOH9718N

ERC Advanced Grant ERC-2015-AdG-IMPaCT

Publisher

ACM

Link

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

Reference66 articles.

1. Asymptotically Tight Bounds for Composing ORAM with PIR

2. On the concrete hardness of Learning with Errors

3. PIR with Compressed Queries and Amortized Query Processing

4. Anastasov Anton. 2016. Implementing Onion ORAM: A Constant Bandwidth ORAM using AHE. https://github.com/aanastasov/onion-oram/blob/master/doc/ report.pdf. (2016). Anastasov Anton. 2016. Implementing Onion ORAM: A Constant Bandwidth ORAM using AHE. https://github.com/aanastasov/onion-oram/blob/master/doc/ report.pdf. (2016).

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

1. Opca: Enabling Optimistic Concurrent Access for Multiple Users in Oblivious Data Storage;IEEE Transactions on Parallel and Distributed Systems;2024-11

2. PEO-Store: Delegation-Proof Based Oblivious Storage With Secure Redundancy Elimination;IEEE Transactions on Dependable and Secure Computing;2024-09

3. Panacea: Non-Interactive and Stateless Oblivious RAM;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08

4. Single-Server PIR via NTRU-Based FHE: Simpler, Smaller, and Faster;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08

5. Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space;IACR Communications in Cryptology;2024-04-09