loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
An Efficient Protocol for the Problem of Secure Two-party Vector Dominance
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
ASCII Text
x 
 
Yingpeng Sang, Hong Shen, Zonghua Zhang, "An Efficient Protocol for the Problem of Secure Two-party Vector Dominance," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 488-492, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.80,
author = {Yingpeng Sang and Hong Shen and Zonghua Zhang},
title = {An Efficient Protocol for the Problem of Secure Two-party Vector Dominance},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {488-492},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.80},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - An Efficient Protocol for the Problem of Secure Two-party Vector Dominance
SN - 0-7695-2405-2
SP488
EP492
A1 - Yingpeng Sang,
A1 - Hong Shen,
A1 - Zonghua Zhang,
PY - 2005
KW - vector dominance
KW - secure multiparty computation
KW - homomorphic encryption.
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Yingpeng Sang, Japan Advanced Institute of Science and Technology
Hong Shen, Japan Advanced Institute of Science and Technology
Zonghua Zhang, Japan Advanced Institute of Science and Technology
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.
Index Terms:
vector dominance, secure multiparty computation,homomorphic encryption.
Citation:
Yingpeng Sang, Hong Shen, Zonghua Zhang, "An Efficient Protocol for the Problem of Secure Two-party Vector Dominance," pdcat, pp.488-492, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.