Cryptology ePrint Archive: Report 2016/568

A Secure One-Roundtrip Index for Range Queries

Tobias Boelter and Rishabh Poddar and Raluca Ada Popa

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.

Category / Keywords: cryptographic protocols /

Original Publication (with minor differences): (Under submission)

Date: received 3 Jun 2016

Contact author: rishabhp at eecs berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20160603:181922 (All versions of this report)

Short URL: ia.cr/2016/568

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]