无条件安全的隐私保护的集合模式匹配协议

Protocol for Privacy Preserving Set Pattern Matching with Unconditionally Secure

在信息论通信模型下,基于秘密分享模式和将集合的元素转化为多项式形式的技术,提出了隐私保护的集合模式匹配的协议.假设参与方都是半诚实的,且合谋的参与方人数少于1/2,那么所提的协议能安全高效地计算集合模式匹配的问题.由于此协议是在信息论通信模型下,所以协议是无条件安全的.

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 pri- vacy preserving set pattern matching, based on the secret sharing scheme and the technique of repre- senting sets as polynomials, is proposed. Assuming that all players are semi-honest, and less than n/2 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.