International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Correlation-Resistant Storage via Keyword-Searchable Encryption

Authors:
Lucas Ballard
Matthew Green
Breno de Medeiros
Fabian Monrose
Download:
URL: http://eprint.iacr.org/2005/417
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12750,
  title={Correlation-Resistant Storage via Keyword-Searchable Encryption},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / anonymity, searchable encryption, bilinear maps},
  url={http://eprint.iacr.org/2005/417},
  note={ mgreen@cs.jhu.edu 13109 received 18 Nov 2005, last revised 22 Nov 2005},
  author={Lucas Ballard and Matthew Green and Breno de Medeiros and Fabian Monrose},
  year=2005
}