Secure Two-Party Vector Dominance Statistic Protocol and Its Applications
Yongbin Wang · Dianzi xuebao · 2010
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.