Secure multiparty computation of sets is one of the most important problems in confidential scientific computing re-search,which has significant applications in electronic election,threshold signature,and confidential auction.This paper mainly studies secure set operations for multiple parties.Corresponding coding methods are proposed for different set operations to transform sets into vectors,and then these vectors are divided in pairs and encoded by Gödel coding.Combined with the ElGamal threshold encryption algorithm with homomorphism,several secure computing protocols for set intersection and union operations are designed in the semi-honest model.These protocols can resist any collusive attack of arbitrary parties and the simulation para-digm is used to prove that these proposed protocols are secure in the semi-honest model.The protocols'efficiency is verified by experiments.When the cardinality of set meets certain conditions,the proposed protocols have higher computational efficiency compared with the existing schemes.
关键词
安全多方计算/集合交集与并集/ElGamal加密算法/半诚实模型/模拟范例
Key words
Secure multiparty computation/Set intersection and union/ElGamal encryption algorithm/Semi-honest model/Simula-tion paradigm
维普
万方数据