Towards Achieving Keyword Search over Dynamic Encrypted Cloud Data with Symmetric-Key Based Verification

Towards Achieving Keyword Search over Dynamic Encrypted Cloud Data with Symmetric-Key Based Verification

IEEE BASE PAPER ABSTRACT:

Verifiable Searchable Symmetric Encryption, as an important cloud security technique, allows users to retrieve the encrypted data from the cloud through keywords and verify the validity of the returned results. Dynamic update for cloud data is one of the most common and fundamental requirements for data owners in such schemes. To the best of our knowledge, the existing verifiable SSE schemes supporting data dynamic update are all based on asymmetric-key cryptography verification, which involves time-consuming operations. The overhead of verification may become a significant burden due to the sheer amount of cloud data. Therefore, how to achieve keyword search over dynamic encrypted cloud data with efficient verification is a critical unsolved problem. To address this problem, we explore achieving keyword search over dynamic encrypted cloud data with symmetric-key based verification and propose a practical scheme in this paper. In order to support the efficient verification of dynamic data, we design a novel Accumulative Authentication Tag (AAT) based on the symmetric-key cryptography to generate an authentication tag for each keyword. Benefiting from the accumulation property of our designed AAT, the authentication tag can be conveniently updated when dynamic operations on cloud data occur. In order to achieve efficient data update, we design a new secure index composed by a search table ST based on the orthogonal list and a verification list VL containing AATs. Owing to the connectivity and the flexibility of ST, the update efficiency can be significantly improved. The security analysis and the performance evaluation results show that the proposed scheme is secure and efficient.

PROJECT OUTPUT VIDEO:

EXISTING SYSTEM:

• The first scheme, which adopts the Message Authentication Code (MAC) to verify the search results, works fine with static cloud data. However, when the data is updated, the data user cannot verify whether the returned results are newly updated or not. If the cloud server returns a result including a pair of non-updated file and MAC, it can pass the verification. So it is unable to defend against the replay attack.

• In order to solve this problem, the second scheme uses the timestamp functionality of the RSA accumulator to obtain the verifiability of search results. It generates accumulators for all files and for all index vector bits, which are kept by the data owner. If the cloud server returns the non-updated results, the data owner can detect them with the newest accumulators.

• The follow-up schemes utilize RSA accumulator to achieve the verification for search results and the dynamic update for cloud data. Scheme leverages bilinear-map accumulator to achieve the result verification and the data dynamics.

DISADVANTAGES OF EXISTING SYSTEM:

• RSA accumulator and bilinear-map accumulator are both based on asymmetric-key cryptography involving time-consuming operations.

• The overhead of verification will become a significant computation burden for resource-constrained devices in these schemes. Therefore, it is a critical unsolved problem to realize efficient verification for dynamic SSE schemes.

PROPOSED SYSTEM:

• In this paper, we explore how to achieve keyword search over dynamic encrypted cloud data with symmetric-key based verification.

• In order to support the efficient verification of dynamic data, we design a novel symmetric-key based Accumulative Authentication Tag (AAT) to generate an authentication tag for each keyword. Benefiting from the accumulation property of our designed AAT, the authentication tag can be conveniently updated when dynamic operations on cloud data occur.

• In order to realize efficient data update, we design a new secure index composed by a search table ST and a verification list VL. ST is based on the orthogonal list and VL is a singly linked list.

• For each keyword, we construct a linked list with the same length aiming at hiding the frequency of each keyword. When performing modification operations, the cloud server can fleetly find the index nodes related to the modified files. When some files need to be added or deleted, the secure index can be conveniently enlarged or reduced. Owing to the connectivity and flexibility of ST, the update efficiency can be significantly improved.

• Based on the above technique and structure, we design the first keyword search scheme over dynamic encrypted cloud data with symmetric-key based verification.

ADVANTAGES OF PROPOSED SYSTEM:

• The proposed AAT is collision resistant, that is, it is computational-difficult for any adversary to find different messages with the same tag. It also can resist the replay attack to prevent the cloud server from returning the old data that actually has been updated.

• We give the security analysis of the proposed scheme and conduct the performance comparison with other work in terms of the search token generation efficiency, verification efficiency and update efficiency. The results show that the proposed scheme is secure and efficient.

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 10/11.
• Coding Language : JAVA.
• Frontend : JSP, HTML, CSS, JavaScript.
• IDE Tool : Netbeans 8.2
• Database : MYSQL

REFERENCE:

Xinrui Ge, Jia Yu, Hanlin Zhang, Chengyu Hu, Zengpeng Li, Zhan Qin, Rong Hao, “Towards Achieving Keyword Search over Dynamic Encrypted Cloud Data with Symmetric-Key Based Verification”, IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021.

PROJECT COST: Rs.3000/

PROJECT BUY LINK: Click here to buy this project in Online.