TY - GEN
T1 - An efficient protocol for the problem of secure two-party vector dominance
AU - Sang, Yingpeng
AU - Shen, Hong
AU - Zhang, Zonghua
PY - 2005
Y1 - 2005
N2 - The problem of secure two-party vector dominance requires the comparison of two vectors in an "all-or-nothing" way. In this paper we provide a solution to this problem based on the semi-honest model. It is reduced to the problem of privacy preserving prefix test, and an additive threshold homomorphic encryption is used to protect those privacies while computing the results of all of the prefix tests. Our solution has advantages of efficiency and security in comparison with other solutions.
AB - The problem of secure two-party vector dominance requires the comparison of two vectors in an "all-or-nothing" way. In this paper we provide a solution to this problem based on the semi-honest model. It is reduced to the problem of privacy preserving prefix test, and an additive threshold homomorphic encryption is used to protect those privacies while computing the results of all of the prefix tests. Our solution has advantages of efficiency and security in comparison with other solutions.
KW - Homomorphic encryption
KW - Secure multiparty computation
KW - Vector dominance
UR - http://www.scopus.com/inward/record.url?scp=33745150744&partnerID=8YFLogxK
U2 - 10.1109/PDCAT.2005.80
DO - 10.1109/PDCAT.2005.80
M3 - Conference contribution
AN - SCOPUS:33745150744
SN - 0769524052
SN - 9780769524054
T3 - Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
SP - 488
EP - 492
BT - Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
T2 - 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Y2 - 5 December 2005 through 8 December 2005
ER -