• Vijayendra S. Gaikwad
• Amit A. Kadam
• Jitendra C. Musale
• Rahul B. Diwate

Now a days, with data mining computation being performed by cloud servers it is a problem to 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 solution deals with single comparison; however, in many applications, we encounter situations where it is necessary to make multiple comparisons to find the maximum among several encrypted data, so we make a modification to our protocol to solve the multiple comparisons problem. Such a secure comparison is an important building block for applications like privacy preserving data mining and secure business. Also our protocols can be performed in constant rounds and do not use general circuit evaluation techniques so they are more efficient than circuit based ones but not general. Implementation is easy and fast.

Secure two party computation; multiple comparisons, Encrypted data

"Comparison over Encrypted Data for Privacy Preservation Based on Homomorphic Encryption", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.153-156, January-2019, Available :http://www.jetir.org/papers/JETIRW006033.pdf

"Comparison over Encrypted Data for Privacy Preservation Based on Homomorphic Encryption", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp153-156, January-2019, Available at : http://www.jetir.org/papers/JETIRW006033.pdf