Author:
Chan T.-H. Hubert,Guo Yue,Lin Wei-Kai,Shi Elaine
Publisher
Springer International Publishing
Reference43 articles.
1. Adler, M., Chakrabarti, S., Mitzenmacher, M., Rasmussen, L.E.: Parallel randomized load balancing. Random Struct. Algorithms 13(2), 159–188 (1998)
2. Ajtai, M., Komlós, J., Szemerédi, E.: An O(N Log N) sorting network. In: STOC (1983)
3. Asharov, G., Chan, H., Nayak, K., Pass, R., Ren, L., Shi, E.: Oblivious computation with data locality. IACR Cryptology ePrint Archive 2017/772 (2017)
4. Bast, H., Hagerup, T.: Fast and reliable parallel hashing. In: SPAA (1991)
5. Lecture Notes in Computer Science;E Boyle,2016
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
2. GraphOS: Towards Oblivious Graph Processing;Proceedings of the VLDB Endowment;2023-09
3. Oblivious RAM (ORAM);Encyclopedia of Cryptography, Security and Privacy;2023-08-10
4. Generalized cuckoo hashing with a stash, revisited;Information Processing Letters;2023-03
5. Oblivious RAM with Worst-Case Logarithmic Overhead;Journal of Cryptology;2023-02-24