Enhanced Database Security Using Homomorphic Encryption

When sensitive data is stored on publicly available areas, privacy of that data becomes a concern. Organizations may wish to move data to public servers so the data is more accessible by their employees or consumers. It is important that this data be encrypted to ensure it remains confidential and secure. When this data is encrypted, it becomes difficult or impossible to perform calculations on a publicly stored database. A solution to this is homomorphic encryption, which allows an unlimited number of computations on encrypted data. This project analyzes an N-tier rotation scheme which allows an unlimited number of addition and subtractions of encrypted data, along with an unlimited number of scalar multiplications and divisions. This scheme is inspired by a combination lock and features multiple levels of security depth. The result of the proposed algorithm is a fast encryption scheme which allows data to be manipulated post encryption.