Improved Blind Seer System With Constant Communication Rounds

Date and time: 
Wednesday, June 7, 2017 - 14:30
Location: 
220 Deschutes
Author(s):
Zhangxiang Hu
University of Oregon
Host/Committee: 
  • Chris Wilson (Chair)
  • Xiaodi Wu
  • Jun Li

Abstract

Private queries bring new challenges to database design.  The recent work of the Blind Seer system introduces a new method having an efficient sublinear search for an arbitrary boolean query.  It splits an index server from the (main) server so that the client can communicate with the index server to retrieve the encrypted records.  During the query, the server learns nothing about the query.

The original work requires the server to stay online to wait for the client to request the decryption key.  In this work, we design a new protocol where the client needs only to communicate with the index server.  In addition, in the original system, the number of communication rounds between the client and the index server was linear in the depth of the search tree.  In our protocol, we can reduce that to a constant number of rounds.