An efficient protocol for the problem of secure two-party vector dominance

Yingpeng Sang, Hong Shen, Zonghua Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Pages488-492
Number of pages5
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005 - Dalian, China
Duration: 5 Dec 20058 Dec 2005

Publication series

NameParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
Volume2005

Conference

Conference6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Country/TerritoryChina
CityDalian
Period5/12/058/12/05

Keywords

  • Homomorphic encryption
  • Secure multiparty computation
  • Vector dominance

Fingerprint

Dive into the research topics of 'An efficient protocol for the problem of secure two-party vector dominance'. Together they form a unique fingerprint.

Cite this