An efficient scheme of common secure indices for conjunctive keyword-based retrieval on encrypted data

27Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the following problem: members in a dynamic group retrieve their encrypted data from an untrusted server based on keywords and without any loss of data confidentiality and member's privacy. In this paper, we investigate common secure indices for conjunctive keyword-based retrieval over encrypted data, and construct an efficient scheme from Wang et al. dynamic accumulator, Nyberg combinatorial accumulator and Kiayias et al. public-key encryption system. The proposed scheme is trapdoorless and keyword-field free. The security is proved under the random oracle, decisional composite residuosity and extended strong RSA assumptions. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, P., Wang, H., & Pieprzyk, J. (2009). An efficient scheme of common secure indices for conjunctive keyword-based retrieval on encrypted data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5379 LNCS, pp. 145–159). https://doi.org/10.1007/978-3-642-00306-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free