You are looking at a specific version 20190312:120001 of this paper. See the latest version.

Paper 2019/274

Path Oblivious Heap

Elaine Shi

Abstract

We propose Path Oblivious Heap, an extremely simple, practical, and optimal oblivious priority queue. Path Oblivious Heap is only a small constant factor slower than the standard insecure binary heap. Our construction also implies a practical and optimal oblivious sorting algorithm.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Oblivious algorithms
Contact author(s)
runting @ gmail com
History
2019-11-10: last of 2 revisions
2019-03-12: received
See all versions
Short URL
https://ia.cr/2019/274
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.