Abstract:
Searchable encryption (SE) has gained popularity in encrypted cloud storage due to the high demand for searchability over encrypted data. Most SE-based cloud storage systems assume the cloud server is honest-but-curious and follows the protocol to return valid and complete search results. Misconfigurations and malfunctions can invalidate this trust assumption.
SE-based cloud storage systems depend on search result verifiability. Many verifiable SE schemes have been proposed, but they either fail to support query operators “OR,” “AND,” “,” and “?” simultaneously or require many time-consuming operations. This paper proposes a verifiable SE scheme for encrypted cloud storage to address this issue.
For efficient and verifiable conjunctive and fuzzy queries over encrypted cloud data, the proposed scheme integrates bitmap index, radix tree, format preserving encryption, keyed-hash message authentication code, and symmetric key encryption.
Detailed security analysis shows that our proposed scheme maintains data confidentiality and search result verifiability. Extensive experiments show that our proposed scheme is efficient and suitable for cloud-to-mobile data retrieval.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
