Privacy-preserving protocols for string matching

Luo, Yonglong and Shi, Lei and Zhang, Caiyun and Zhang, Ji (2010) Privacy-preserving protocols for string matching. In: NSS 2010: 4th International Conference on Network and System Security , 1-3 Sep 2010, Melbourne, Australia.

Metadata

HTML Citation

EndNote

Dublin Core

Reference Manager

Full text available as:

Preview

PDF (Documentation) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
384Kb

Identification Number or DOI: doi: 10.1109/NSS.2010.24

Abstract

String matching is a basic problem of string operation, and privacy-preserving string matching, as a special case of secure multi-party computation, has broad applications in auction, bidding and some other commercial areas. In this paper, some protocols are proposed to solve this private matching problem, the security and correctness are analyzed respectively, and the actual efficiency is tested by experiment. A protocol is also designed based on the BMH algorithm which is more efficient and conceals more private information.

Item Type:	Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)
Additional Information:	Permanent restricted access to Published version, due to publisher copyright restrictions.
Uncontrolled Keywords:	computer security; information security; privacy
Fields of Research (FOR2008):	08 Information and Computing Sciences > 0801 Artificial Intelligence and Image Processing > 080109 Pattern Recognition and Data Mining 09 Engineering > 0906 Electrical and Electronic Engineering > 090609 Signal Processing 08 Information and Computing Sciences > 0803 Computer Software > 080303 Computer System Security
Subjects:	UNSPECIFIED
Socio-Economic Objective (SEO2008):	E Expanding Knowledge > 97 Expanding Knowledge > 970108 Expanding Knowledge in the Information and Computing Sciences
ID Code:	18209
Deposited By:	Dr Ji Zhang
Deposited On:	16 Feb 2011 12:13
Last Modified:	23 Jan 2012 13:10

Archive Staff Only: edit this record