Two-Party Private Vector Dominance: The All-Or-Nothing Deal

@article{Ibrahim2006TwoPartyPV,
  title={Two-Party Private Vector Dominance: The All-Or-Nothing Deal},
  author={Maged Hamada Ibrahim},
  journal={Third International Conference on Information Technology: New Generations (ITNG'06)},
  year={2006},
  pages={166-171}
}
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 e-commerce applications, Alice holds an n-dimension secret vector alpha = (a1, ..., an) while Bob holds an n-dimension secret vector beta = (b1,..., bn). Alice and Bob want to decide on one of the three possible domination results, alpha beta, beta alpha, or no domination… CONTINUE READING

Similar Papers

Loading similar papers…