• Anem Surendra
• L.Venkateswara Kiran
• PSsiva Prasad

Securing the protection of cell phone client members is critical for cell phone detecting applications. In this paper, we ponder how an aggregator can quickly figure the base esteem or the k-th least estimation of all user’s data without knowing them. We build two secure conventions utilizing probabilistic coding plans and a figure framework that allows homomorphic bitwise XOR calculations for our issues. Following the standard cryptographic security definition in the semi-genuine model, we formally demonstrate our convention’s security. The conventions proposed by us can bolster time-arrangement information and need not to expect the aggregator is trusted. In addition, unique in relation to existing conventions that depend on secure arithmetic sum calculations, our conventions depend on secure bitwise XOR calculations, along these lines are progressively proficient.

Ponder, Aggregator ,Kth-Least estimation, Homomorphic,

"Protecting the Mobile User’s Privacy Data By Bitwise XOR Homomorphic Encryption ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.160-162, April-2019, Available :http://www.jetir.org/papers/JETIR1904E25.pdf

"Protecting the Mobile User’s Privacy Data By Bitwise XOR Homomorphic Encryption ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp160-162, April-2019, Available at : http://www.jetir.org/papers/JETIR1904E25.pdf