Paper 2005/417

Correlation-Resistant Storage via Keyword-Searchable Encryption

Lucas Ballard and Matthew Green and Breno de Medeiros and Fabian Monrose

Abstract

We consider the problem of using untrusted components to build correlation-resistant survivable storage systems that protect file replica locations, while allowing nodes to continuously re-distribute files throughout the network. The principal contribution is a chosen-ciphertext secure, searchable public key encryption scheme which allows for dynamic re-encryption of ciphertexts, and provides for node-targeted searches based on keywords or other identifiers. The scheme is provably secure under the SXDH assumption which holds in certain subgroups of elliptic curves, and a closely related assumption that we introduce.

Note: Some references added to bibliography.