Anonymous Searchable Encryption Scheme for Multi-user Databases
Vijay Varadharajan, R. Mani, Rajarathnam Nallusamy · 2013
With the ever advancing technology of fast information processing, protecting data with only access control mechanisms is becoming increasingly difficult. If someone breaks into a database, the entire data will be compromised if it is in plaintext form. One quick remedy is to keep the data in encrypted form. However, encryption will make it difficult to do any operations on the data. This has prompted considerable research in the last decade and has led to various schemes of searchable encryption. It allows search over the encrypted data. There are various techniques which support different levels of querying, making it suitable for variety of applications. However, almost all of them are either symmetric-key or single-user schemes or require key sharing. Here, we are proposing a new scheme which will allow multiple users to encrypt, store and decrypt their own data, along with support for doing data searches over all the data by other users.