The feasibility of outsourced database search in the plain model

Carmit Hazay, Hila Zarosim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


The problem of securely outsourcing computation to an untrusted server gained momentum with the recent penetration of cloud computing services. The ultimate goal in this setting is to design efficient protocols that minimize the computational overhead of the clients and instead rely on the extended resources of the server. In this paper, we focus on the outsourced database search problem which is highly motivated in the context of delegatable computing since it offers storage alternatives for massive databases, that may contain confidential data. This functionality is described in two phases: (1) setup phase and (2) query phase. The main goal is to minimize the parties workload in the query phase so that it is proportional to the query size and its corresponding response. We study whether a trusted setup or a random oracle are necessary for protocols with minimal interaction that meet the optimal communication and computation bounds in the query phase. We answer this question positively and demonstrate a lower bound on the communication or the computational overhead in this phase.

Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings
EditorsRoberto De Prisco, Vassilis Zikas
PublisherSpringer Verlag
Number of pages20
ISBN (Print)9783319446172
StatePublished - 2016
Event10th International Conference on Security and Cryptography for Networks, SCN 2016 - Amalfi, Italy
Duration: 31 Aug 20162 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9841 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Conference on Security and Cryptography for Networks, SCN 2016

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2016.


  • Communication and computational complexities
  • Database search functionalities
  • Lower bound
  • Minimal interaction
  • Outsourced computation


Dive into the research topics of 'The feasibility of outsourced database search in the plain model'. Together they form a unique fingerprint.

Cite this