Author:
Lu Steve,Ostrovsky Rafail
Publisher
Springer Berlin Heidelberg
Reference42 articles.
1. Ajtai, M.: Oblivious RAMs without cryptogrpahic assumptions. In: STOC, pp. 181–190 (2010)
2. Ajtai, M., Komlós, J., Szemerédi, E.: An O(n logn) sorting network. In: STOC, pp. 1–9 (1983)
3. Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference, pp. 307–314 (1968)
4. Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: How to remove intractability assumptions. In: STOC, pp. 113–131 (1988)
5. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
Cited by
75 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Single Round-trip Hierarchical ORAM via Succinct Indices;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07
2. Efficient Actively Secure DPF and RAM-based 2PC with One-Bit Leakage;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19
3. Conditional Lower Bounds for Oblivious RAM;Encyclopedia of Cryptography, Security and Privacy;2024
4. Privacy-Preserving Dijkstra;Lecture Notes in Computer Science;2024
5. FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15