DocumentCode
3063596
Title
An Efficient Protocol for the Problem of Secure Two-party Vector Dominance
Author
Sang, Yingpeng ; Shen, Hong ; Zhang, Zonghua
Author_Institution
Japan Advanced Institute of Science and Technology
fYear
2005
fDate
05-08 Dec. 2005
Firstpage
488
Lastpage
492
Abstract
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.
Keywords
homomorphic encryption.; secure multiparty computation; vector dominance; Computer networks; Cryptography; Distributed computing; Information science; Privacy; Protection; Protocols; Security; Sliding mode control; Testing; homomorphic encryption.; secure multiparty computation; vector dominance;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN
0-7695-2405-2
Type
conf
DOI
10.1109/PDCAT.2005.80
Filename
1578963
Link To Document