PROJECT TITLE :
Publicly Verifiable Boolean Query over Outsourced Encrypted Data - 2017
Outsourcing storage and computation to the cloud has become a typical apply for businesses and individuals. As the cloud is semi-trusted or inclined to attacks, many researches counsel that the outsourced data ought to be encrypted and then retrieved by using searchable symmetric encryption (SSE) schemes. Since the cloud isn't fully trusted, we doubt whether or not it might forever method queries properly or not. Therefore, there's a need for users to verify their question results. Motivated by this, during this paper, we tend to propose a publicly verifiable dynamic searchable symmetric encryption theme primarily based on the buildup tree. We have a tendency to initial construct an accumulation tree primarily based on encrypted knowledge and then outsource both of them to the cloud. Next, throughout the search operation, the cloud generates the corresponding proof in line with the question result by mapping Boolean question operations to set operations, whereas keeping privacy-preservation and achieving the verification necessities: freshness, authenticity, and completeness. Finally, we tend to extend our theme by dividing the buildup tree into completely different little accumulation trees to create our scheme scalable. The safety analysis and performance evaluation show that the proposed scheme is secure and sensible.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here