Non-interactive fuzzy private matching

J.M. Doumen

Non-interactive fuzzy private matching

J.M. Doumen

Research output: Working paper

79 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 language	English
Place of Publication	Enschede
Publisher	Centre for Telematics and Information Technology (CTIT)
Number of pages	7
Publication status	Published - 20 Jun 2007

Publication series

Name	CTIT Technical Report Series
Publisher	Centre 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

Access to Document

Doumen2007non-interactiveFinal published version, 112 KB

Cite this

@techreport{1e12e141708a4626ab8b42305365da83,

title = "Non-interactive fuzzy private matching",

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.",

keywords = "MSC-11T71, SCS-Cybersecurity, Cryptography, Fuzzy extractors, Private equality testing",

author = "J.M. Doumen",

year = "2007",

month = jun,

day = "20",

language = "English",

series = "CTIT Technical Report Series",

publisher = "Centre for Telematics and Information Technology (CTIT)",

number = "TR-CTIT-07-45",

address = "Netherlands",

type = "WorkingPaper",

institution = "Centre for Telematics and Information Technology (CTIT)",

}

TY - UNPB

T1 - Non-interactive fuzzy private matching

AU - Doumen, J.M.

PY - 2007/6/20

Y1 - 2007/6/20

N2 - 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.

AB - 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.

KW - MSC-11T71

KW - SCS-Cybersecurity

KW - Cryptography

KW - Fuzzy extractors

KW - Private equality testing

M3 - Working paper

T3 - CTIT Technical Report Series

BT - Non-interactive fuzzy private matching

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -

Non-interactive fuzzy private matching

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this