基于 Goldwasser-Micali 加密算法的安全子集计算.

This paper studied the problem of secure subset which most of the existing protocols that solve such problems can only keep the elements of one set private to. Under the semi-honest model, this paper constructed a secure subset protocol by using Bloom filter and Goldwasser-Micah homomorphic encryption algorithm, and proved the security of the protocol by using common simulation examples in secure multi-party computing. It used the Bloom filter to map a data set with a large number or large number field elements into a smaller data set, improved the efficiency and range of the protocol, at the same time, it used the Goldwasser-Micali homomorphic encryption algorithm to ensure the security of the protocol. Most of the relevant researches were based on the difficult problems such that secondary residuals, it is impossible to resist quantum attacks, and the secure subset computation which can resist quantum attacks is a further research direction. [ABSTRACT FROM AUTHOR]