Article: Prediction-based robust blind reversible watermarking for relational databases Journal: International Journal of Information and Computer Security (IJICS) 2021 Vol.14 No.3/4 pp.211 - 228 Abstract: As the size of database grows, the possibility of database corruption also increases. One such example is of temporal databases in which deletion never occurs except in case of vacuuming. A strong security mechanism is needed to find any database modification. In case of any tampering, tampered data should be identified and recovery of original data from the tampered one is also essential. In this work, a new watermarking scheme for database authentication and forensic analysis is developed. The proposed system uses a set of watermark bits to make a validation and recovery mechanism for database authentication. In order to measure the robustness of this approach, online available yahoo financial data is watermarked through this approach and simulation of insertion, modification and deletion attacks are performed. Normalised correlation (NC) and mean square error (MSE) are used for measuring the performance of this approach. Extensive analysis shows that the proposed method is robust against various forms of database attacks, including insertion, deletion and modification. In future, in order to identify the best possible locations for embedding the watermark, optimisation algorithms can be used. Also methods may be developed for enhancing the embedding capacity of the watermark. Inderscience Publishers - linking academia, business and industry through research

Title: Prediction-based robust blind reversible watermarking for relational databases

Authors: K. Unnikrishnan; K.V. Pramod

Addresses: Department of Computer Science and Engineering, Rajiv Gandhi Institute of Technology, Kottayam, Kerala, India ' Department of Computer Applications, Cochin University of Science and Technology, Cochin, Kerala, India

Abstract: As the size of database grows, the possibility of database corruption also increases. One such example is of temporal databases in which deletion never occurs except in case of vacuuming. A strong security mechanism is needed to find any database modification. In case of any tampering, tampered data should be identified and recovery of original data from the tampered one is also essential. In this work, a new watermarking scheme for database authentication and forensic analysis is developed. The proposed system uses a set of watermark bits to make a validation and recovery mechanism for database authentication. In order to measure the robustness of this approach, online available yahoo financial data is watermarked through this approach and simulation of insertion, modification and deletion attacks are performed. Normalised correlation (NC) and mean square error (MSE) are used for measuring the performance of this approach. Extensive analysis shows that the proposed method is robust against various forms of database attacks, including insertion, deletion and modification. In future, in order to identify the best possible locations for embedding the watermark, optimisation algorithms can be used. Also methods may be developed for enhancing the embedding capacity of the watermark.

Keywords: database watermarking; database forensic analysis; tuple insertion attack; tuple deletion attack; tuple modification attack.

DOI: 10.1504/IJICS.2021.114702

International Journal of Information and Computer Security, 2021 Vol.14 No.3/4, pp.211 - 228

Received: 09 May 2017
Accepted: 23 Feb 2018
Published online: 04 May 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Prediction-based robust blind reversible watermarking for relational databases

Keep up-to-date