Author:
Barenghi Alessandro,Pelosi Gerardo
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Asharov G, Komargodski I, Lin W, Nayak K, Peserico E, Shi E (2023) OptORAMa: optimal oblivious RAM. J ACM 70(1):4:1–4:70. https://doi.org/10.1145/3566049
2. Chan TH, Guo Y, Lin W, Shi E (2017) Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM. In: Takagi T, Peyrin T (eds) Advances in Cryptology – ASIACRYPT 2017 – 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, 3–7 Dec 2017. Proceedings, Part I. Lecture Notes in Computer Science, vol 10624. Springer, pp 660–690. https://doi.org/10.1007/978-3-319-70694-8_23
3. Devadas S, van Dijk M, Fletcher CW, Ren L, Shi E, Wichs D (2016) Onion ORAM: a constant bandwidth blowup oblivious RAM. In: Kushilevitz E, Malkin T (eds) Theory of Cryptography – 13th International Conference, TCC 2016-A, Tel Aviv, Israel, 10–13 Jan 2016. Proceedings, Part II. Lecture Notes in Computer Science, vol 9563. Springer, pp 145–174. https://doi.org/10.1007/978-3-662-49099-0_6
4. Goldreich O (1987) Towards a theory of software protection and simulation by oblivious RAMs. In: Aho AV (ed) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987. ACM, New York, USA, pp 182–194. https://doi.org/10.1145/28395.28416
5. Goldreich O, Ostrovsky R (1996) Software protection and simulation on oblivious RAMs. J ACM 43(3):431–473. https://doi.org/10.1145/233551.233553