Non-interactive fuzzy private matching

J.M. Doumen

    Research output: Working paper

    9 Downloads (Pure)

    Abstract

    Two fuzzy private matching protocols are introduced to allow a client to securely compare a list of words to a server list, and discover only those words on the server list that are similar to his, while the server learns nothing. The first protocol achieves perfect client security, while the second achieves almostprivacy and perfect server security. Both protocols are efficient in both communication and computation complexity: for lists of length $n$, only $O(n)$ communication and $O(n^2)$ computation is needed.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages7
    Publication statusPublished - 20 Jun 2007

    Publication series

    NameCTIT Technical Report Series
    PublisherCentre for Telematics and Information Technology, University of Twente
    No.TR-CTIT-07-45
    ISSN (Print)1381-3625

    Keywords

    • MSC-11T71
    • SCS-Cybersecurity
    • Cryptography
    • Fuzzy extractors
    • Private equality testing

    Fingerprint Dive into the research topics of 'Non-interactive fuzzy private matching'. Together they form a unique fingerprint.

    Cite this