Shared and searchable encrypted data for untrusted servers
Dong, Changyu and Russello, Giovanni and Dulay, Naranker (2011) Shared and searchable encrypted data for untrusted servers. Journal of Computer Security, 19 (3). pp. 367-397. ISSN 0926-227X (https://doi.org/10.3233/JCS-2010-0415)
Preview |
PDF.
Filename: jcs.pdf
Accepted Author Manuscript Download (681kB)| Preview |
Abstract
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client side is the normal approach in this situation but has high communication and computation overheads if only a subset of the data is required, for example, selecting records in a database table based on a keyword search. New cryptographic schemes have been proposed that support encrypted queries over encrypted data. But they all depend on a single set of secret keys, which implies single user access or sharing keys among multiple users, with key revocation requiring costly data re-encryption. In this paper, we propose an encryption scheme where each authorised user in the system has his own keys to encrypt and decrypt data. The scheme supports keyword search which enables the server to return only the encrypted data that satisfies an encrypted query without decrypting it. We provide a concrete construction of the scheme and give formal proofs of its security. We also report on the results of our implementation.
ORCID iDs
Dong, Changyu ORCID: https://orcid.org/0000-0002-8625-0275, Russello, Giovanni and Dulay, Naranker;-
-
Item type: Article ID code: 35992 Dates: DateEvent2011Published31 May 2011Published OnlineSubjects: Science > Mathematics > Electronic computers. Computer science Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 18 Nov 2011 05:20 Last modified: 11 Nov 2024 09:51 URI: https://strathprints.strath.ac.uk/id/eprint/35992