Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead-Reference-Cited by-同舟云学术

Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead

Published:2014 Issue: Volume: Page:62-81
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chung Kai-Min,Liu Zhenming,Pass Rafael

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-45608-8_4

Reference33 articles.

1. Ajtai, M.: Oblivious RAMs without cryptogrpahic assumptions. In: STOC, pp. 181–190 (2010)

2. Boneh, D., Mazieres, D., Popa, R.A.: Remote oblivious storage: Making oblivious RAM practical. CSAIL Technical Report: MIT-CSAIL-TR-2011-018 (2012)

3. Chung, K.M., Lam, H., Liu, Z., Mitzenmacher, M.: Chernoff-Hoeffding bounds for Markov chains: Generalized and simplified. In: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS (2012)

4. Chung, K.-M., Liu, Z., Pass, R.: Statistically-secure ORAM with \tilde{O}(\log^2 n overhead. CoRR, abs/1307.3699 (2013)

5. Chung, K.-M., Pass, R.: A simple ORAM. Cryptology ePrint Archive, Report 2013/243 (2013)

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

1. Distributed & Scalable Oblivious Sorting and Shuffling;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

2. GraphOS: Towards Oblivious Graph Processing;Proceedings of the VLDB Endowment;2023-09

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

4. Lower Bound Framework for Differentially Private and Oblivious Data Structures;Advances in Cryptology – EUROCRYPT 2023;2023

5. Locality-Preserving Oblivious RAM;Journal of Cryptology;2022-01-24