An Efficient Protocol for the Problem of Secure Two-party Vector Dominance

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Yingpeng Sang, Hong Shen, Zonghua Zhang
Format: Conference Proceeding
Language:English
Subjects:
Computer networks
Cryptography
Distributed computing
homomorphic encryption
Information science
Privacy
Protection
Protocols
secure multiparty computation
Security
Sliding mode control
Testing
vector dominance
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2379-5352
DOI:10.1109/PDCAT.2005.80