Affiliations: [a] Department of Computing, Imperial College London, London, UK. E-mails: [email protected], [email protected], | [b] Security Area, Create-Net, Via alla Cascata 56/D Povo, Trento, Italy. E-mail: [email protected]
Correspondence:
[*]
Corresponding author.
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.
Keywords: Searchable encryption, secure data outsourcing, proxy encryption
