Correlation-Resistant Storage via Keyword-Searchable Encryption

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

Paper 2005/417

Correlation-Resistant Storage via Keyword-Searchable Encryption

Lucas Ballard, Matthew Green, 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.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: anonymity searchable encryption bilinear maps
Contact author(s): mgreen @ cs jhu edu
History: 2005-11-22: revised; 2005-11-21: received; See all versions
Short URL: https://ia.cr/2005/417
License: CC BY

BibTeX

@misc{cryptoeprint:2005/417,
      author = {Lucas Ballard and Matthew Green and Breno de Medeiros and Fabian Monrose},
      title = {Correlation-Resistant Storage via Keyword-Searchable Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2005/417},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/417}},
      url = {https://eprint.iacr.org/2005/417}
}