Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36941
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | An efficient protocol for the problem of secure two-party vector dominance |
Author: | Sang, Y. Shen, H. Zhang, Z. |
Citation: | PDCAT 2005 : 5-8 December 2005, Dalian, China : proceedings / Hong Shen and Koji Nakano (eds.), pp. 488-492 |
Publisher: | IEEE Computer Science |
Publisher Place: | Online |
Issue Date: | 2005 |
ISBN: | 0769524052 9780769524054 |
Conference Name: | International Conference on Parallel and Distributed Computing, Applications and Technologies (6th : 2005 : Dalian, China) |
Statement of Responsibility: | Yingpeng Sang, Hong Shen, Zonghua Zhang |
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: | vector dominance, secure multiparty computation,homomorphic encryption |
DOI: | 10.1109/PDCAT.2005.80 |
Published version: | http://dx.doi.org/10.1109/pdcat.2005.80 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
hdl_36941.pdf | 196.86 kB | Publisher's PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.