摘要
安全两方向量优势统计问题是百万富翁问题的推广问题,用于两方在不泄漏自己保密向量信息的前提下统计出满足大于关系的分量的数目.本文在半诚实模型下利用加同态加密体制解决了安全两方向量优势统计问题,分析了该解决方案的正确性,安全性和复杂性;利用该优势统计协议设计了一个安全两方向量分量和排序协议,并且将设计的安全两方向量分量和排序协议应用于安全生成最小树图形算法中.
Secure two-party vector dominance statistic problem is a problem generalized from the millionaires＇ problem,which can be used by two party to get the number of aibi without leaking further information.A secure two-party vector dominance statistic protocol in semi-honest model is presented based on the additive homomorphic encryption.The correctness,security and complexity of the protocol are analyzed.A secure components sum of two vectors ranking protocol is proposed based on the dominance statistic protocol and the ranking protocol is also applied in the secure minimum spanning trees algorithm.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2010年第11期2573-2577,共5页
Acta Electronica Sinica
基金
2009年北京市文化创意产业发展专项资金
国家"211工程"项目
校级工科规划项目(No.XNG0925)
关键词
安全两方计算
安全两方向量优势统计问题
安全两方向量分量和排序协议
安全生成最小树
secure two-party computation
secure two-party vector dominance statistic problem
secure components sum of two vectors ranking protocol
secure minimum spanning trees algorithm
