Secure computation of the vector dominance problem

Authors:
Jin Yuan;Qingsong Ye;Huaxiong Wang;Josef Pieprzyk
Affiliations:
Center for Advanced Computing-Algorithms and Cryptography, Department of Computing, Macquarie University, NSW, Australia;Center for Advanced Computing-Algorithms and Cryptography, Department of Computing, Macquarie University, NSW, Australia;Center for Advanced Computing-Algorithms and Cryptography, Department of Computing, Macquarie University, NSW, Australia and Division of Mathematical Sciences, Nanyang Technological University, Si ...;Center for Advanced Computing-Algorithms and Cryptography, Department of Computing, Macquarie University, NSW, Australia
Venue:
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Year:
2008

Citing 12
Cited 1

A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Protocol for the Problem of Secure Two-party Vector Dominance

PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Testing disjointness of private datasets

FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
An efficient solution to the millionaires' problem based on homomorphic encryption

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Conditional encrypted mapping and comparing encrypted numbers

FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Honest-verifier private disjointness testing without random oracles

PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies

Secure distributed computation of anonymized views of shared databases

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Suppose two parties, holding vectors A = (a1, a2,..., an) and B = (b1, b2,..., bn) respectively, wish to know whether ai bi for all i, without disclosing any private input. This problem is called the vector dominance problem, and is closely related to the well-studied problem for securely comparing two numbers (Yao's millionaires problem). In this paper, we propose several protocols for this problem, which improve upon existing protocols on round complexity or communication/computation complexity.