The study of set problems serves as the foundation for secure multi-party computations.However,existing protocols,when dealing with set intersection problems,fail to ensure the privacy and correctness of set operations and are limited to values within the entire set range.These problems result in limited application scope and vulnerability to attacks by malicious adversaries,leading to low security.To address this issue,we transformed the problem of determining the existence of a set intersection into one of set element subtraction.Based on an efficient elliptic curve encryption scheme,a secure computing protocol was designed to find the set intersec-tion of sets without full set constraints in a semi-honest model.Furthermore,with the assistance of cryptographic tools,we developed a secure computation protocol for finding set intersections without full set constraints under malicious models.This new protocol can en-hance resistance to malicious attacks.It can also prevent participants from inferring information about other participants through observ-ing results,thereby improving the overall security of the protocol.Moreover,the computational and communication complexity of our protocol is lower than that of other existing protocols of the same type.
关键词
安全多方计算/集合交集/椭圆曲线加密/分割-选择/理想-实际范例
Key words
secure multi-party computation/intersection of sets/elliptic curve encryption/Cut-and-Choose/real/ideal model paradigm
维普
万方数据