Document Open Access Logo

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues

Authors Thore Thießen , Jan Vahrenhold

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2024.55.pdf
  • Filesize: 0.91 MB
  • 18 pages

Document Identifiers

Author Details

Thore Thießen
  • University of Münster, Germany
Jan Vahrenhold
  • University of Münster, Germany

Acknowledgements

We thank all anonymous reviewers for their constructive comments that helped to improve the presentation.

Cite As Get BibTex

Thore Thießen and Jan Vahrenhold. Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues. In 35th International Symposium on Algorithms and Computation (ISAAC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 322, pp. 55:1-55:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ISAAC.2024.55

Abstract

Oblivious RAM (ORAM) is a well-researched primitive to hide the memory access pattern of a RAM computation; it has a variety of applications in trusted computing, outsourced storage, and multiparty computation. In this paper, we study the so-called offline ORAM in which the sequence of memory access locations to be hidden is known in advance. Apart from their theoretical significance, offline ORAMs can be used to construct efficient oblivious algorithms.
We obtain the first optimal offline ORAM with perfect security from oblivious priority queues via time-forward processing. For this, we present a simple construction of an oblivious priority queue with perfect security. Our construction achieves an asymptotically optimal (amortized) runtime of Θ(log N) per operation for a capacity of N elements and is of independent interest.
Building on our construction, we additionally present efficient external-memory instantiations of our oblivious, perfectly-secure construction: For the cache-aware setting, we match the optimal I/O complexity of Θ(1/B log N/M) per operation (amortized), and for the cache-oblivious setting we achieve a near-optimal I/O complexity of O(1/B log N/M log log_M N) per operation (amortized).

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
  • Theory of computation → Cryptographic protocols
Keywords
  • offline ORAM
  • oblivious priority queue
  • perfect security
  • external memory algorithm
  • cache-oblivious algorithm

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988. URL: https://doi.org/10.1145/48529.48535.
  2. Miklós Ajtai, Jánoss Komlós, and Endre Szemerédi. An O(n log n) sorting network. In David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, and Joel I. Seiferas, editors, Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 1-9. ACM, 1983. URL: https://doi.org/10.1145/800061.808726.
  3. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, and J. Ian Munro. Cache-oblivious priority queue and graph algorithm applications. In John H. Reif, editor, Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pages 268-276. ACM, 2002. URL: https://doi.org/10.1145/509907.509950.
  4. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, and Elaine Shi. OptORAMa: Optimal oblivious RAM. Journal of the ACM, 70(1):4:1-4:70, 2022. URL: https://doi.org/10.1145/3566049.
  5. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, and Elaine Shi. Oblivious RAM with worst-case logarithmic overhead. Journal of Cryptology, 36(2):7, 2023. URL: https://doi.org/10.1007/s00145-023-09447-5.
  6. Kenneth E. Batcher. Sorting networks and their applications. In Proceedings of the April 30-May 2, 1968, Spring Joint Computer Conference, volume 32 of AFIPS Conference Proceedings, pages 307-314. ACM, 1968. URL: https://doi.org/10.1145/1468075.1468121.
  7. Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, and Robert Endre Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973. URL: https://doi.org/10.1016/S0022-0000(73)80033-9.
  8. Elette Boyle and Moni Naor. Is there an oblivious RAM lower bound? In Madhu Sudan, editor, Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pages 357-368. ACM, 2016. URL: https://doi.org/10.1145/2840728.2840761.
  9. T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, and Elaine Shi. Cache-oblivious and data-oblivious sorting and applications. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2201-2220. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.143.
  10. T.-H. Hubert Chan and Elaine Shi. Circuit OPRAM: Unifying statistically and computationally secure ORAMs and OPRAMs. In Yael Kalai and Leonid Reyzin, editors, Theory of Cryptography, volume 10678 of Lecture Notes in Computer Science, pages 72-107. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-70503-3_3.
  11. T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, and Kartik Nayak. Perfectly oblivious (parallel) RAM revisited, and improved constructions. In Stefano Tessaro, editor, 2nd Conference on Information-Theoretic Cryptography (ITC 2021), volume 199 of LIPIcs, pages 8:1-8:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.ITC.2021.8.
  12. Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, and Jeffrey Scott Vitter. External-memory graph algorithms. In Kenneth L. Clarkson, editor, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149. SIAM, 1995. URL: http://dl.acm.org/citation.cfm?id=313651.313681.
  13. Samuel Dittmer and Rafail Ostrovsky. Oblivious tight compaction in O(n) time with smaller constant. In Clemente Galdi and Vladimir Kolesnikov, editors, Security and Cryptography for Networks, volume 12238 of Lecture Notes in Computer Science, pages 253-274. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-57990-6_13.
  14. Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. Cache-oblivious algorithms. In 40th Annual Symposium on Foundations of Computer Science, pages 285-297. IEEE, 1999. URL: https://doi.org/10.1109/SFFCS.1999.814600.
  15. D. Gale and L. S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9-15, 1962. URL: https://doi.org/10.1080/00029890.1962.11989827.
  16. Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431-473, 1996. URL: https://doi.org/10.1145/233551.233553.
  17. Michael T. Goodrich. Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. In Rajmohan Rajaraman and Friedhelm Meyer auf der Heide, editors, Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 379-388. ACM, 2011. URL: https://doi.org/10.1145/1989493.1989555.
  18. Michael T. Goodrich and Joseph A. Simons. Data-oblivious graph algorithms in outsourced external memory. In Zhao Zhang, Lidong Wu, Wen Xu, and Ding-Zhu Du, editors, Combinatorial Optimization and Applications, volume 8881 of Lecture Notes in Computer Science, pages 241-257. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-12691-3_19.
  19. Atsunori Ichikawa and Wakaha Ogata. Perfectly secure oblivious priority queue. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E106.A(3):272-280, 2023. URL: https://doi.org/10.1587/transfun.2022CIP0019.
  20. Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In 19th Annual Network and Distributed System Security Symposium. The Internet Society, 2012. URL: https://www.ndss-symposium.org/ndss2012/access-pattern-disclosure-searchable-encryption-ramification-attack-and-mitigation.
  21. Riko Jacob, Kasper Green Larsen, and Jesper Buus Nielsen. Lower bounds for oblivious data structures. In Timothy M. Chan, editor, Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2439-2447. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.149.
  22. Zahra Jafargholi, Kasper Green Larsen, and Mark Simkin. Optimal oblivious priority queues. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2366-2383. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976465.141.
  23. Marcel Keller and Peter Scholl. Efficient, oblivious data structures for MPC. In Palash Sarkar and Tetsu Iwata, editors, Advances in Cryptology - ASIACRYPT 2014, volume 8874 of Lecture Notes in Computer Science, pages 506-525. Springer, 2014. URL: https://doi.org/10.1007/978-3-662-45608-8_27.
  24. Kasper Green Larsen and Jesper Buus Nielsen. Yes, there is an oblivious RAM lower bound! In Hovav Shacham and Alexandra Boldyreva, editors, Advances in Cryptology - CRYPTO 2018, volume 10992 of Lecture Notes in Computer Science, pages 523-542. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-96881-0_18.
  25. Wei-Kai Lin, Elaine Shi, and Tiancheng Xie. Can we overcome the n log n barrier for oblivious sorting? In Timothy M. Chan, editor, Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2419-2438. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.148.
  26. John C. Mitchell and Joe Zimmerman. Data-oblivious data structures. In Ernst W. Mayr and Natacha Portier, editors, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), volume 25 of LIPIcs, pages 554-565. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. URL: https://doi.org/10.4230/LIPIcs.STACS.2014.554.
  27. Arup Mondal, Priyam Panda, Shivam Agarwal, Abdelrahaman Aly, and Debayan Gupta. Fast and secure oblivious stable matching over arithmetic circuits. Cryptology ePrint Archive, Paper 2023/1789, 2023. URL: https://eprint.iacr.org/2023/1789.
  28. Dag Arne Osvik, Adi Shamir, and Eran Tromer. Cache attacks and countermeasures: The case of AES. In David Pointcheval, editor, Topics in Cryptology - CT-RSA 2006, volume 3860 of Lecture Notes in Computer Science, pages 1-20. Springer, 2006. URL: https://doi.org/10.1007/11605805_1.
  29. Elaine Shi. Path oblivious heap: Optimal and practical oblivious priority queue. In 2020 IEEE Symposium on Security and Privacy (SP), pages 842-858. IEEE, 2020. URL: https://doi.org/10.1109/SP40000.2020.00037.
  30. Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. Path ORAM: An extremely simple oblivious RAM protocol. In Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, pages 299-310. ACM, 2013. URL: https://doi.org/10.1145/2508859.2516660.
  31. Thore Thießen and Jan Vahrenhold. Optimal offline ORAM with perfect security via simple oblivious priority queues, 2024. URL: https://doi.org/10.48550/arXiv.2409.12021.
  32. Tomas Toft. Secure datastructures based on multiparty computation. Cryptology ePrint Archive, Paper 2011/081, 2011. URL: https://eprint.iacr.org/2011/081.
  33. Xiao Shaun Wang, Kartik Nayak, Chang Liu, T.-H. Hubert Chan, Elaine Shi, Emil Stefanov, and Yan Huang. Oblivious data structures. In Gail-Joon Ahn, Moti Yung, and Ninghui Li, editors, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pages 215-226. ACM, 2014. URL: https://doi.org/10.1145/2660267.2660314.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact