Two-party private vector dominance: the all-or-nothing deal.Two-party private vector dominance: the all-or-nothing deal.

Access Restriction
Open

 Author Ibrahim, Maged Hamada Source CiteSeerX Content type Text File Format PDF
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Two-party Private Vector Dominance ♦ All-or-nothing Deal ♦ Secret Integer ♦ N-dimension Secret Vector ♦ Third Party ♦ Possible Domination Result ♦ Ecommerce Application ♦ Practical Solution ♦ Complete Security Proof ♦ Honest-but-curious Scenario ♦ Efficient Solution Abstract Alice holds a secret integer a while Bob holds a secret integer b, they want to decide on the predicate a > b with no information revealed other than the result. This is the well known Yao's millionaires' problem. In some ecommerce applications, Alice holds an n-dimension secret vector # = (a 1 , ..., a n ) while Bob holds an n-dimension secret vector # = (b 1 , ..., b n ). Alice and Bob want to decide on one of the three possible domination results, # #, or no domination exists, with no information revealed other than the result. I.e., in case there is a domination, no information is revealed about any dimension, whereas, in case no domination exists, no information is revealed about the predicate a i > b i for any i = 1, ..., n. In the honest-but-curious scenario and without the help of a third party, in this paper we propose an efficient solution to this problem. We give a complete security proof. Up to our knowledge, no practical solution to this problem -- that does not incorporate a third party -- has been proposed. Educational Role Student ♦ Teacher Age Range above 22 year Educational Use Research Education Level UG and PG ♦ Career/Technical Study Learning Resource Type Article