Cryptology ePrint Archive: Report 2010/061

Privacy-Preserving Matching Protocols for Attributes and Strings

Pu Duan, Sanmin Liu, Weiqin Ma, Guofei Gu and Jyh-Charn Liu

Abstract: In this technical report we present two new privacy-preserving matching protocols for singular attributes and strings, respectively. The first one is used for matching of common attributes without revealing unmatched ones to each other. The second protocol is used to discover the longest common sub-string of two input strings in a privacy-preserving manner. Compared with previous work, our solutions are efficient and suitable to implement for many different applications, e.g., discovery of common worm signatures, computation of similarity of IP payloads.

Category / Keywords: privacy-preserving attribute matching, longest common sub-string, elliptic curve cryptosystem

Date: received 4 Feb 2010, last revised 23 Jun 2010

Contact author: duanpu1979 at tamu edu

Available format(s): PDF | BibTeX Citation

Version: 20100623:082236 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]