The feasibility of outsourced database search in the plain model

Carmit Hazay; Hila Zarosim

doi:10.1007/978-3-319-44618-9_17

The feasibility of outsourced database search in the plain model

Carmit Hazay, Hila Zarosim

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

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 language	English
Title of host publication	Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings
Editors	Roberto De Prisco, Vassilis Zikas
Publisher	Springer Verlag
Pages	313-332
Number of pages	20
ISBN (Print)	9783319446172
DOIs	https://doi.org/10.1007/978-3-319-44618-9_17
State	Published - 2016
Event	10th International Conference on Security and Cryptography for Networks, SCN 2016 - Amalfi, Italy Duration: 31 Aug 2016 → 2 Sep 2016

Publication series

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

Conference

Conference	10th International Conference on Security and Cryptography for Networks, SCN 2016
Country/Territory	Italy
City	Amalfi
Period	31/08/16 → 2/09/16

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2016.

Keywords

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

Access to Document

10.1007/978-3-319-44618-9_17

Cite this

Hazay, C., & Zarosim, H. (2016). The feasibility of outsourced database search in the plain model. In R. De Prisco, & V. Zikas (Eds.), Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings (pp. 313-332). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9841 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-44618-9_17

Hazay, Carmit ; Zarosim, Hila. / The feasibility of outsourced database search in the plain model. Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings. editor / Roberto De Prisco ; Vassilis Zikas. Springer Verlag, 2016. pp. 313-332 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{207613a1e6504f2e902b9fdaebf61c6b,

title = "The feasibility of outsourced database search in the plain model",

abstract = "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.",

keywords = "Communication and computational complexities, Database search functionalities, Lower bound, Minimal interaction, Outsourced computation",

author = "Carmit Hazay and Hila Zarosim",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 10th International Conference on Security and Cryptography for Networks, SCN 2016 ; Conference date: 31-08-2016 Through 02-09-2016",

year = "2016",

doi = "10.1007/978-3-319-44618-9_17",

language = "אנגלית",

isbn = "9783319446172",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "313--332",

editor = "{De Prisco}, Roberto and Vassilis Zikas",

booktitle = "Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings",

address = "גרמניה",

}

Hazay, C & Zarosim, H 2016, The feasibility of outsourced database search in the plain model. in R De Prisco & V Zikas (eds), Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9841 LNCS, Springer Verlag, pp. 313-332, 10th International Conference on Security and Cryptography for Networks, SCN 2016, Amalfi, Italy, 31/08/16. https://doi.org/10.1007/978-3-319-44618-9_17

The feasibility of outsourced database search in the plain model. / Hazay, Carmit; Zarosim, Hila.
Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings. ed. / Roberto De Prisco; Vassilis Zikas. Springer Verlag, 2016. p. 313-332 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9841 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The feasibility of outsourced database search in the plain model

AU - Hazay, Carmit

AU - Zarosim, Hila

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Communication and computational complexities

KW - Database search functionalities

KW - Lower bound

KW - Minimal interaction

KW - Outsourced computation

UR - http://www.scopus.com/inward/record.url?scp=84984824722&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-44618-9_17

DO - 10.1007/978-3-319-44618-9_17

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84984824722

SN - 9783319446172

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 313

EP - 332

BT - Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings

A2 - De Prisco, Roberto

A2 - Zikas, Vassilis

PB - Springer Verlag

T2 - 10th International Conference on Security and Cryptography for Networks, SCN 2016

Y2 - 31 August 2016 through 2 September 2016

ER -

Hazay C, Zarosim H. The feasibility of outsourced database search in the plain model. In De Prisco R, Zikas V, editors, Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings. Springer Verlag. 2016. p. 313-332. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-44618-9_17

The feasibility of outsourced database search in the plain model

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this