Paper 2016/568 Original: eprint.iacr.org/2016/568 ↗
A Secure One-Roundtrip Index for Range Queries
Abstract
We present the first one-roundtrip protocol for performing range, range-aggregate, and order-by-limit queries over encrypted data, that both provides semantic security and is efficient. We accomplish this task by chaining garbled circuits over a search tree, using branch-chained garbled circuits, as well as carefully designing garbled circuits. We then show how to build a database index that can answer order comparison queries. We implemented and evaluated our index. We demonstrate that queries as well as inserts and updates are efficient, and that our index outperforms previous interactive constructions. This index is part of the Arx database system, whose source code will be released in the near future.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2016-06-03: last updated
- 2016-06-03: published
- Short URL
- https://ia.cr/2016/568
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/568,
author = {Tobias Boelter and Rishabh Poddar and Raluca Ada Popa},
title = {A Secure One-Roundtrip Index for Range Queries},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/568},
year = {2016},
url = {https://eprint.iacr.org/2016/568}
}