Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
Thießen, Thore; Vahrenhold, Jan
Research article in edited proceedings (conference) | Peer reviewedDetails about the publication
Editors: Mestre, Julián; Wirth, Anthony
Book title: Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024)
Page range: 55:1-55:18
Article number: 55
Publisher: Dagstuhl Publishing
Place of publication: Saarbrücken/Wadern
Title of series: LIPIcs - Leibniz International Proceedings in Informatics (ISSN: 1868-8969)
Status: Published
Release year: 2024
Language in which the publication is written: English
Conference: 35th International Symposium on Algorithms and Computation, Sydney, Australia
ISBN: 978-3-95977-354-6
Keywords: ORAM; Data Structures; Priority Queue; Offline
Authors from the University of Münster
| Thießen, Thore | |
| Vahrenhold, Jan |
Doctorates the publication originates from
| Perfectly Secure Oblivious Algorithms for Geometric Problems Candidate: ??? | Supervisors: Vahrenhold, Jan | Reviewers: Vahrenhold, Jan; Komm, Dennis Period of time: 01/07/2020 - 19/01/2026 Doctoral examination procedure finished at: Doctoral examination procedure at University of Münster |