Alisha Rohilla

Work place: Department of Computer Science and Engineering & Information Technology, the NorthCap University Gurugram, 122002, India



Research Interests: Information Security, Network Security, Digital Library, Information-Theoretic Security


Alisha Rohilla is a MTech student of Department of Computer Science and Engineering & Information Technology of The NorthCap University, Gurugram, specialised under the huge umbrella of Cyber Security. She completed her BTech in Computer Science from Institute of Technology and Management, Gurgaon in 2012 after which she worked with TATA Consultancy Services for 2.5 years as a System Engineer. Her area of interest are cryptography, cyber security, digital forensics, and identity and access management.

Author Articles
Location Privacy using Homomorphic Encryption over Cloud

By Alisha Rohilla Mehak Khurana Latika Singh

DOI:, Pub. Date: 8 Aug. 2017

Homomorphism is a concept that allows one to perform arbitrary calculations on the cipher text. One of the application of this concept is securing one’s location while one uses location based services(LBS). In this paper I have discussed an approach to preserve mobile user’s location while accessing some location based service. The mobile user is trying to find the nearest locations of his interest using a mobile application. While doing so he wishes to keep his location coordinates a secret from the server. This is because, these days since servers may be maintained by a third party or a middleware might be involved. There is no scope of trusting anyone in this insecure world. Therefore, since in homomorphic encryption offers a way of making calculations on the cipher text thereby not revealing anything about the plaintext to the server, it becomes a more secure and safer choice for making a system which wants to keep the data protected from the server.
Problem Statement: Implementing k-nearest neighbour algorithm while preserving user location privacy using homomorphic encryption.

[...] Read more.
Homomorphic Cryptosystem

By Alisha Rohilla Mehak Khurana Meena Kumari

DOI:, Pub. Date: 8 May 2017

In 2009 Craig Gentry proved that Fully Homomorphic Encryption can be applied and realized in principle. Homomorphism allowed us to perform arbitrary computations and calculations on encrypted data. With RSA being the first cryptosystem to hold homomorphic properties, there came other additive and multiplicative cryptosystems. However, fully Homomorphic encryption proved to be the ultimate cryptographic solution to ensure security of data on cloud. It enables processing and computing arbitrary functions over the encrypted data thereby reducing the probability of accessing the plain text.

[...] Read more.
Other Articles