Secure two party comparison over encrypted data

@article{Kaghazgaran2011SecureTP,
  title={Secure two party comparison over encrypted data},
  author={Parisa Kaghazgaran and Babak Sadeghyan},
  journal={2011 World Congress on Information and Communication Technologies},
  year={2011},
  pages={1123-1126}
}
Yao's classical millionaires' problem is about securely determining whether x>y, given two input values x, y, which are held as private inputs by two parties, respectively. The output which is result of comparison becomes known to both parties. In this paper we consider a variant of comparison problem in which the inputs x, y are encrypted and the actual values are not known to the parties. Our first solution deals with single comparison; however, in many applications, we encounter situations… CONTINUE READING

From This Paper

Topics from this paper.
6 Citations
11 References
Similar Papers

Similar Papers

Loading similar papers…