Paper 2010/061

Privacy-Preserving Matching Protocols for Attributes and Strings

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


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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
privacy-preserving attribute matchinglongest common sub-stringelliptic curve cryptosystem
Contact author(s)
duanpu1979 @ tamu edu
2010-06-23: last of 4 revisions
2010-02-08: received
See all versions
Short URL
Creative Commons Attribution


      author = {Pu Duan and Sanmin Liu and Weiqin Ma and Guofei Gu and Jyh-Charn Liu},
      title = {Privacy-Preserving Matching Protocols for Attributes and Strings},
      howpublished = {Cryptology ePrint Archive, Paper 2010/061},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.