检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:巩一德 张恩[1] 王梦涛 Gong Yide;Zhang En;Wang Mengtao(College of Computer&Information Engineering,Henan Normal University,Xinxiang Henan 453007,China)
机构地区:[1]河南师范大学计算机与信息工程学院,河南新乡453007
出 处:《计算机应用研究》2024年第12期3834-3842,共9页Application Research of Computers
基 金:国家自然科学基金资助项目(62072159,62002103,6207608)。
摘 要:概率门限隐私集合交集研究作为门限隐私集合交集的一种概率变体,在指纹或人脸识别、联邦学习等领域比确定型门限隐私集合交集协议效率更高。然而现有的概率门限隐私集合交集协议缺少针对恶意模型下的多方概率门限隐私集合交集的研究。针对该问题,提出了两种在恶意模型下安全的多方概率门限隐私集合交集协议。第一个多方概率门限隐私集合交集协议在参与方之间没有合谋行为时,能够抵御任意恶意敌手,并且使用对称密钥源语高效地实现了协议。该协议在八个参与方的场景下,集合大小为2^(20),门限值为0.5 n,协议的时间成本约为24.59 s。此外,在第一个协议的基础上结合零共享方案以及不经意可编程伪随机函数设计了一种抗合谋版本的协议,即当两个指定参与方不同时参与合谋时,该协议可以抵抗任意参与方子集进行合谋攻击。在相同实验设置下,当合谋参与方数量为N/2时,协议的时间成本约为40.00 s。与现有方案的实验对比可得,该协议具有更多的应用场景与更好的效率。As a probabilistic variant of threshold private set intersection,probabilistic threshold private set intersection research is more efficient than deterministic threshold private set intersection protocol in fingerprint or face recognition,federated learning and other fields.However,the existing probabilistic threshold private set intersection protocols lack of research on multi-party probabilistic threshold private set intersection protocols under the malicious model.To address this problem,this paper proposed two multi-party probabilistic threshold private set intersection protocols that were secure under the malicious model.The first multi-party probabilistic threshold private set intersection protocol could resist any malicious adversary when there was no collusion among the participants,and it was efficiently implemented by using symmetric key primitives.In the setting of eight parties,the set size was 2^(20),the threshold value was 0.5 n,and the time cost of the protocol was about 24.59.In addition,on the basis of the first protocol,it designed a collusion-resistant version of the protocol by combining the zero-sharing scheme and the obliviously programmable pseudo-random function.That was,when the two designated parties did not participate in collusion at the same time,the protocol could resist the collusion attack of any subset of participants.Under the same experimental setting,when the number of colluding parties was N/2,the time cost of the protocol was about 40.00 s.Compared with the existing schemes,the proposed protocol has more application scenarios and better efficiency.
关 键 词:概率门限隐私集合交集 不经意键值对存储 恶意安全 不经意可编程伪随机函数
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49