Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference61 articles.
1. I. Abraham, C.W. Fletcher, K. Nayak, B. Pinkas, L. Ren, Asymptotically tight bounds for composing ORAM with PIR, in Public-Key Cryptography—PKC 2017—20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28–31, 2017, Proceedings, Part I (2017), pp. 91–120
2. G. Asharov, I. Komargodski, W.-K. Lin, K. Nayak, E. Peserico, E. Shi, OptORAMa: optimal oblivious RAM, in Advances in Cryptology—EUROCRYPT 2020—39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part II (2020), pp. 403–432
3. M. Ajtai, J. Komlós, E. Szemerédi, An $${O}(n \log n)$$ sorting network, in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983 (1983), pp. 1–9.
4. D. Apon, J. Katz, E. Shi, A. Thiruvengadam, Verifiable oblivious storage, in Public-Key Cryptography—PKC 2014—17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26–28, 2014. Proceedings (2014), pp. 131–148
5. E. Boyle, K.-M. Chung, R. Pass, Large-scale secure computation: multi-party computation for (parallel) RAM programs, in Advances in Cryptology—CRYPTO 2015—35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16–20, 2015, Proceedings, Part II (2015), pp. 742–762
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献