Block-Based Scheme for Database Integrity Verification

Camara, Lancine; Li, Junyi; Li, Renfa; Kagorora, Faustin; Hanyurwimfura, Damien

doi:10.14257/ijsia.2014.8.6.03

Cited by 4 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The dataset D is to be divided into m non-overlapping groups, namely, such that each partition Si holds on the average |D|/m tuples from the dataset D; see [10][24] [26][27][28][29][30][31][32][33][34][35] for more details. In this case, an attacker cannot guess the tuples-to-partition transfer without the awareness of the secret key Ks and the number of partitions m, which are reserved secret.…”

Section: Methodsmentioning

confidence: 99%

Design and Analysis of an Intelligent Integrity Checking Watermarking Scheme for Ubiquitous Database Access

Darwish

Selim

2018

Int. J. Art. Intell. Research

View full text Add to dashboard Cite

As a result of the highly distributed nature of ubiquitous database accessing, it is essential to develop security mechanisms that lend themselves well to the delicate properties of outsourcing databases integrity and copyright protection. Researchers have begun to study how watermarking computing can make ubiquitous databases accessing more confident work environments. One area where database context may help is in supporting content integrity. Initially, most of the research effort in this field was depending on distortion based watermark while the few remaining studies concentrated on distortion-free. But there are many disadvantages in previous studies; most notably some rely on adding watermark as an extra attributes or tuples, which increase the size of the database. Other techniques such as permutation and abstract interpretation framework require much effort to verify the watermark. The idea of this research is to adapt an optimized distortion free watermarking based on fake tuples that are embedded into a separate file not within the database to validate the content integrity for ubiquitous database accessing. The proposed system utilizes the GA, which boils down its role to create the values of the fake tuples as watermark to be the closest to real values. So that it's very hard to any attacker to guess the watermark. The proposed technique achieves more imperceptibility and security. Experimental outcomes confirm that the proposed algorithm is feasible, effective and robust against a large number of attacks.

show abstract

Section: Methodsmentioning

confidence: 99%

Design and Analysis of an Intelligent Integrity Checking Watermarking Scheme for Ubiquitous Database Access

Darwish

Selim

2018

Int. J. Art. Intell. Research

View full text Add to dashboard Cite

show abstract

“…In addition, the DF is zero if any single row or column has zero values only. In order to alleviate this problem, a new technique is performed as given below: For each element of the matrix is reconstructed using matrix dialing method to formalize the original data matrix into a new matrix [20]. The determinants of both original and Dialing rotational matrices computed and appended with each matrix.…”

Section: Proposed Methodologymentioning

confidence: 99%

Block Level Data Integrity Assurance Using Matrix Dialing Method towards High Performance Data Security on Cloud Storage

Premkumar¹,

Shanthi²

2016

View full text Add to dashboard Cite

Data outsourcing through cloud storage enables the users to share on-demand resources with cost effective IT services but several security issues arise like confidentiality, integrity and authentication. Each of them plays an important role in the successful achievement of the other. In cloud computing data integrity assurance is one of the major challenges because the user has no control over the security mechanism to protect the data. Data integrity insures that data received are the same as data stored. It is a result of data security but data integrity refers to validity and accuracy of data rather than protect the data. Data security refers to protection of data against unauthorized access, modification or corruption and it is necessary to ensure data integrity. This paper proposed a new approach using Matrix Dialing Method in block level to enhance the performance of both data integrity and data security without using Third Party Auditor (TPA). In this approach, the data are partitioned into number of blocks and each block converted into a square matrix. Determinant factor of each matrix is generated dynamically to ensure data integrity. This model also implements a combination of AES algorithm and SHA-1 algorithm for digital signature generation. Data coloring on digital signature is applied to ensure data security with better performance. The performance analysis using cloud simulator shows that the proposed scheme is highly efficient and secure as it overcomes the limitations of previous approaches of data security using encryption and decryption algorithms and data integrity assurance using TPA due to server computation time and accuracy.

show abstract

“…Algorithm 1 shows the parsing process used in the paper. The proposed partitioning algorithm is the partitioning technique used in [15] .It partitions the database R composed of α tuples and γ attributes to v different groups. The partitioning is based on a primary key attribute P of each tuple and a secret key K , a secure hash function is computed for each tuple and γ tuples are inserted logically into individual partition described as the following:…”

Section: Database Partitioningmentioning

confidence: 99%

“…Since our technique is fragile and malicious modifications in database is not allowed but if a modification occurs in the database, the partition determinant value will inevitably change. In our previous work [11,15], we analyzed the success of the use of probability to change the database while keeping the watermark intact is hard to process may be impossible. By using theory of probability, the probability of successfully modifying the database by preserving its group's determinant values becomes: where  represents the number of database attribute and  the number of database tuples, having a large database the probability of success is very small and approaches zero.…”

Section: Security and Analysismentioning

confidence: 99%

An Effective Approach for Non-Numeric Relational Database Verification

Camara¹,

Coulibaly²,

Hamadou³

et al. 2017

IJDTA

Self Cite

View full text Add to dashboard Cite

With the large distribution of digital data, protecting their integrity becomes necessary and digital watermarking has been proposed as solution for protecting the content of relational database. Previous watermarking techniques mainly focus on the numeric database authentication by inserting watermark bits in digital data which may greatly degrade the data quality. In this paper, we present a distortion free approach to verify the integrity of a combined numeric and non-numeric relational database. The technique first partitions the database in different groups of square matrices, then the ASCII code of non-numeric data of group attributes are computed and used to generate the watermark. Security analyzes and experiments demonstrated that the proposed technique is resilient against malicious attacks and moreover the tampering can be detected up to group level.

show abstract

Block-Based Scheme for Database Integrity Verification

Cited by 4 publications

References 20 publications

Design and Analysis of an Intelligent Integrity Checking Watermarking Scheme for Ubiquitous Database Access

Design and Analysis of an Intelligent Integrity Checking Watermarking Scheme for Ubiquitous Database Access

Block Level Data Integrity Assurance Using Matrix Dialing Method towards High Performance Data Security on Cloud Storage

An Effective Approach for Non-Numeric Relational Database Verification

Contact Info

Product

Resources

About