ABSTRACT:
Outsourcing storage and computation
to the cloud has become a common practice for businesses and individuals. As
the cloud is semi-trusted or susceptible to attacks, many researches suggest
that the outsourced data should be encrypted and then retrieved by using
searchable symmetric encryption (SSE) schemes. Since the cloud is not fully
trusted, we doubt whether it would always process queries correctly or not.
Therefore, there is a need for users to verify their query results. Motivated
by this, in this paper, we propose a publicly verifiable dynamic searchable
symmetric encryption scheme based on the accumulation tree. We first construct
an accumulation tree based on encrypted data and then outsource both of them to
the cloud. Next, during the search operation, the cloud generates the
corresponding proof according to the query result by mapping Boolean query
operations to set operations, while keeping privacy-preservation and achieving
the verification requirements: freshness, authenticity, and completeness.
Finally, we extend our scheme by dividing the accumulation tree into different
small accumulation trees to make our scheme scalable. The security analysis and
performance evaluation show that the proposed scheme is secure and practical.
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
·
System : Pentium Dual Core.
·
Hard Disk : 120 GB.
·
Monitor : 15’’ LED
·
Input Devices : Keyboard, Mouse
·
Ram : 1 GB
SOFTWARE REQUIREMENTS:
·
Operating system : Windows 7.
·
Coding Language : JAVA/J2EE
·
Tool : Netbeans 7.2.1
·
Database : MYSQL
REFERENCE:
Shunrong Jiang,
Xiaoyan Zhu, Linke Guo and Jianqing Liu, “Publicly Verifiable Boolean Query
Over Outsourced Encrypted Data”, IEEE Transactions on Cloud Computing, 2018.