International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Privacy-Preserving Matching Protocols for Attributes and Strings

Authors:
Pu Duan
Sanmin Liu
Weiqin Ma
Guofei Gu
Jyh-Charn Liu
Download:
URL: http://eprint.iacr.org/2010/061
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2010-22962,
  title={Privacy-Preserving Matching Protocols for Attributes and Strings},
  booktitle={IACR Eprint archive},
  keywords={privacy-preserving attribute matching, longest common sub-string, elliptic curve cryptosystem},
  url={http://eprint.iacr.org/2010/061},
  note={ duanpu1979@tamu.edu 14783 received 4 Feb 2010, last revised 23 Jun 2010},
  author={Pu Duan and Sanmin Liu and Weiqin Ma and Guofei Gu and Jyh-Charn Liu},
  year=2010
}