Paper 2013/715
Practical Forward-Secure Range and Sort Queries with Update-Oblivious Linked Lists
Erik-Oliver Blass, Travis Mayberry, and Guevara Noubir
Abstract
We revisit the problem of privacy-preserving range search and sort
queries on encrypted data in the face of an untrusted data store.
Our new protocol RASP has several advantages over existing work.
First, RASP strengthens privacy by ensuring {forward security}:
after a query for range
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- ApplicationsPrivacyCloud ComputingUpdate-Oblivious Data Structures
- Contact author(s)
- blass @ ccs neu edu
- History
- 2015-02-16: last of 3 revisions
- 2013-11-03: received
- See all versions
- Short URL
- https://ia.cr/2013/715
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/715, author = {Erik-Oliver Blass and Travis Mayberry and Guevara Noubir}, title = {Practical Forward-Secure Range and Sort Queries with Update-Oblivious Linked Lists}, howpublished = {Cryptology {ePrint} Archive, Paper 2013/715}, year = {2013}, url = {https://eprint.iacr.org/2013/715} }