Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (1): 99-102.doi: 10.13190/jbupt.200901.99.004

• Reports • Previous Articles     Next Articles

Protocol for Privacy preserving Set Pattern Matching with Unconditionally Secure

ZHENG Qiang   

  • Received:2008-07-15 Revised:1900-01-01 Online:2009-01-28 Published:2009-01-28
  • Contact: ZHENG Qiang

Abstract:

To overcome the inadequate of the existed protocols for privacy preserving set operation that almost comes from homomorphic public-key encryption in the cryptographic model. A protocol for privacy preserving set pattern matching, based on the secret sharing scheme and the technique of representing sets as polynomials, is proposed. Assuming that all players are semi-honest, and less than players collude, the set pattern matching is correctly computed by this protocol. Since the presented protocol is based on information theoretic model, it is unconditionally secure.

Key words: secure multiparty computation, information theoretic model, pattern matching, unconditionally secure