摘要
基于全同态加密技术,构造了一个安全计算集合成员关系问题的多方协议。通过将判定集合成员关系问题转化为范德蒙行列式求值问题,该协议解决了已有研究成果中集合阶数的泄露问题,提高了安全性;并证明其在静态半诚实敌手模型下的安全性。该协议还具有判断集合是否有交集的功能。
Based on the fully homomorphic encryption, a protocol for secure multiparty computing set membership problem is proposed. By converting the problem of determining set membership into computing Vandermonde determinant, this protocol solves the problem of leakage of set orders in existing research results and improves security. The proof shows that the proposed protocol is safe in the presence of static semi-honest adversaries. Besides, this protocol has the function of judging whether two sets have an intersection.
作者
张茜
苏烨
秦静
ZHANG Xi;SU Ye;QIN Jing(School of Mathematics,Shandong University,Jinan 250100,Shandong,China;State Key Laboratory of Cryptology,Beijing 100878,China)
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2020年第4期118-126,共9页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(61772311)
密码科学技术国家重点实验室开放基金资助项目。
关键词
集合成员关系
安全多方计算
范德蒙行列式
全同态加密
set membership
secure multiparty computation
Vandermonde determinant
fully homomorphic encryption
