Ecole d'ingénieur et centre de recherche en Sciences du numérique

Publicly verifiable conjunctive keyword search in outsourced databases

Azraoui, Monir; Elkhiyaoui, Kaoutar; Önen, Melek; Molva, Refik

SPC 2015, 1st IEEE Workshop on Security and Privacy in the Cloud, 30 September 2015, Florence, Italy

Recent technological developments in cloud computing and the ensuing commercial appeal have encouraged companies and individuals to outsource their storage and computations to powerful cloud servers. However, the challenge when outsourcing data and computation is to ensure that the cloud servers comply with their advertised policies. In this paper, we focus in particular on the scenario where a data owner wishes to (i) outsource its public database to a cloud server; (ii) enable anyone to submit multi-keyword search queries to the outsourced database; and (iii) ensure that anyone can verify the correctness of the server's responses. To meet these requirements, we propose a solution that builds upon the well-established techniques of Cuckoo hashing, polynomial-based accumulators and Merkle trees. The key idea is to (i) build an efficient index for the keywords in the database using Cuckoo hashing; (ii) authenticate the resulting index using polynomial-based accumulators and Merkle tree; (iii) and finally, use the root of the Merkle tree to verify the correctness of the server's responses. Thus, the proposed solution yields efficient search and verification and incurs a constant storage at the data owner. Furthermore, we show that it is sound under the strong bilinear Diffie-Hellman assumption and the security of Merkle trees.

Document Doi Bibtex

Titre:Publicly verifiable conjunctive keyword search in outsourced databases
Type:Conférence
Langue:English
Ville:Florence
Pays:ITALIE
Date:
Département:Sécurité numérique
Eurecom ref:4653
Copyright: © 2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @inproceedings{EURECOM+4653, doi = {http://dx.doi.org/10.1109/CNS.2015.7346876}, year = {2015}, title = {{P}ublicly verifiable conjunctive keyword search in outsourced databases}, author = {{A}zraoui, {M}onir and {E}lkhiyaoui, {K}aoutar and {\"{O}}nen, {M}elek and {M}olva, {R}efik }, booktitle = {{SPC} 2015, 1st {IEEE} {W}orkshop on {S}ecurity and {P}rivacy in the {C}loud, 30 {S}eptember 2015, {F}lorence, {I}taly}, address = {{F}lorence, {ITALIE}}, month = {09}, url = {http://www.eurecom.fr/publication/4653} }
Voir aussi: