Different search strategies on encrypted data compared

Richard Brinkman

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    Abstract

    When private information is stored in databases that are under the control of others, the only possible way to protect it, is to encrypt it before storing it. In order to efficiently retrieve the data, a search mechanism is needed that still works over the encrypted data. In this chapter an overview of several search strategies is given. Some add meta-data to the database and do the searching only in the meta-data, others search in the data itself or use secret sharing to solve the problem. Each strategy has its own advantages and disadvantages.
    Original languageUndefined
    Title of host publicationSecurity, Privacy and Trust in Modern Data Management
    EditorsM. Petkovic, W. Jonker, Willem Jonker
    Place of PublicationBerlin
    PublisherSpringer
    Pages183-196
    Number of pages14
    ISBN (Print)978-3-540-69860-9
    DOIs
    Publication statusPublished - May 2007

    Publication series

    NameData-Centric Systems and Applications
    PublisherSpringer Verlag
    Number06472/XVIII
    VolumeXVIII

    Keywords

    • EWI-9949
    • IR-64048
    • METIS-241643

    Cite this

    Brinkman, R. (2007). Different search strategies on encrypted data compared. In M. Petkovic, W. Jonker, & W. Jonker (Eds.), Security, Privacy and Trust in Modern Data Management (pp. 183-196). [10.1007/978-3-540-69861-6_13] (Data-Centric Systems and Applications; Vol. XVIII, No. 06472/XVIII). Berlin: Springer. https://doi.org/10.1007/978-3-540-69861-6_13