scholarly journals Distortion-Free Watermarking Approach for Relational Database Integrity Checking

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Lancine Camara ◽  
Junyi Li ◽  
Renfa Li ◽  
Wenyong Xie
Keyword(s):  
Third Party ◽  
Group Level ◽  
Content Protection ◽  
New Approach ◽  
Matrix Groups ◽  
Database Integrity ◽  
Integrity Checking ◽  
Zero Watermarking ◽  
Database Relation ◽  
Data Usability

Nowadays, internet is becoming a suitable way of accessing the databases. Such data are exposed to various types of attack with the aim to confuse the ownership proofing or the content protection. In this paper, we propose a new approach based on fragile zero watermarking for the authentication of numeric relational data. Contrary to some previous databases watermarking techniques which cause some distortions in the original database and may not preserve the data usability constraints, our approach simply seeks to generate the watermark from the original database. First, the adopted method partitions the database relation into independent square matrix groups. Then, group-based watermarks are securely generated and registered in a trusted third party. The integrity verification is performed by computing the determinant and the diagonal’s minor for each group. As a result, tampering can be localized up to attribute group level. Theoretical and experimental results demonstrate that the proposed technique is resilient against tuples insertion, tuples deletion, and attributes values modification attacks. Furthermore, comparison with recent related effort shows that our scheme performs better in detecting multifaceted attacks.

scholarly journals A Fragile Zero Watermarking Scheme to Detect and Characterize Malicious Modifications in Database Relations

2013 ◽  
Vol 2013 ◽  
pp. 1-16 ◽  
Author(s):  
Aihab Khan ◽  
Syed Afaq Husain
Keyword(s):  
Data Quality ◽  
Relational Database ◽  
Relational Databases ◽  
Original Data ◽  
Experimental Results ◽  
Zero Watermarking ◽  
Watermarking Scheme ◽  
Database Relation ◽  
Data Usability ◽  
Data Modifications

We put forward a fragile zero watermarking scheme to detect and characterize malicious modifications made to a database relation. Most of the existing watermarking schemes for relational databases introduce intentional errors or permanent distortions as marks into the database original content. These distortions inevitably degrade the data quality and data usability as the integrity of a relational database is violated. Moreover, these fragile schemes can detect malicious data modifications but do not characterize the tempering attack, that is, the nature of tempering. The proposed fragile scheme is based on zero watermarking approach to detect malicious modifications made to a database relation. In zero watermarking, the watermark is generated (constructed) from the contents of the original data rather than introduction of permanent distortions as marks into the data. As a result, the proposed scheme is distortion-free; thus, it also resolves the inherent conflict between security and imperceptibility. The proposed scheme also characterizes the malicious data modifications to quantify the nature of tempering attacks. Experimental results show that even minor malicious modifications made to a database relation can be detected and characterized successfully.

scholarly journals Enhanced Integrity Checking for Preserve Data Owner and User Level Privacy Using Dual Cryptography Approach

2019 ◽  
pp. 138-146
Author(s):  
Poovizhi. M ◽  
Raja. G
Keyword(s):  
Data Storage ◽  
Data Privacy ◽  
Capital Expenditure ◽  
Data Access ◽  
Third Party ◽  
Configurable Computing ◽  
Local Data ◽  
Cloud Data ◽  
On Demand ◽  
Integrity Checking

Using Cloud Storage, users can tenuously store their data and enjoy the on-demand great quality applications and facilities from a shared pool of configurable computing resources, without the problem of local data storage and maintenance. However, the fact that users no longer have physical possession of the outsourced data makes the data integrity protection in Cloud Computing a formidable task, especially for users with constrained dividing resources. From users’ perspective, including both individuals and IT systems, storing data remotely into the cloud in a flexible on-demand manner brings tempting benefits: relief of the burden for storage management, universal data access with independent geographical locations, and avoidance of capital expenditure on hardware, software, and personnel maintenances, etc. To securely introduce an effective Sanitizer and third party auditor (TPA), the following two fundamental requirements have to be met: 1) TPA should be able to capably audit the cloud data storage without demanding the local copy of data, and introduce no additional on-line burden to the cloud user; 2) The third party auditing process should take in no new vulnerabilities towards user data privacy. In this project, utilize and uniquely combine the public auditing protocols with double encryption approach to achieve the privacy-preserving public cloud data auditing system, which meets all integrity checking without any leakage of data. To support efficient handling of multiple auditing tasks, we further explore the technique of online signature to extend our main result into a multi-user setting, where TPA can perform multiple auditing tasks simultaneously. We can implement double encryption algorithm to encrypt the data twice and stored cloud server in Electronic Health Record applications.

Database Integrity Checking

2009 ◽  
pp. 212-220 ◽  
Author(s):  
Hendrik Decker ◽  
Davide Martinenghi
Keyword(s):  
Predicate Logic ◽  
Historical Background ◽  
Integrity Constraints ◽  
Future Trends ◽  
Declarative Languages ◽  
Incremental Evaluation ◽  
Database Integrity ◽  
Integrity Checking ◽  
Semantic Correctness ◽  
Formal Representations

Integrity constraints (or simply “constraints”) are formal representations of invariant conditions for the semantic correctness of database records. Constraints can be expressed in declarative languages such as datalog, predicate logic, or SQL. This article highlights the historical background of integrity constraints and the essential features of their simplified incremental evaluation. It concludes with an outlook on future trends.

scholarly journals An Efficient Methodologies for Data Integrity in Cloud Storage

2019 ◽  
Vol 8 (9) ◽  
pp. 2029-2033
Keyword(s):  
Cloud Storage ◽  
Space Complexity ◽  
Third Party ◽  
Limited Resources ◽  
Huge Number ◽  
The Third ◽  
Integrity Checking ◽  
External Sources ◽  
The Cost ◽  
Time And Space Complexity

Majority of the organization uses cloud for storage purpose in order to reduce the cost as well as maintenance. Due to increasing threat from internal and external sources, there would be possibility of corruption in the cloud storage files. Thus the storage must to be monitored periodically for integrity checking. Since most of the Data Owners have limited resources thus the responsibility of integrity checking goes to the Third Party Auditors (TPA). In this paper, we have proposed 2 methodologies of Integrity Checking in Cloud Storage (1) Enhanced Dynamic Hash Tree – n Versions (EDHT-n), which has best performance in term of time and space complexity compared to the existing methods.(2) Hybrid Enhanced Dynamic Hash Tree (HEDHT), which is best suited for very huge number of files in a directory

scholarly journals Cache-Based Privacy Preserving Solution for Location and Content Protection in Location-Based Services

Sensors ◽  
2020 ◽  
Vol 20 (16) ◽  
pp. 4651
Author(s):  
Yuanbo Cui ◽  
Fei Gao ◽  
Wenmin Li ◽  
Yijie Shi ◽  
Hua Zhang ◽  
...  
Keyword(s):  
Location Privacy ◽  
Personal Information ◽  
Single Point ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Third Party ◽  
Content Protection ◽  
Query Privacy ◽  
Service Data

Location-Based Services (LBSs) are playing an increasingly important role in people’s daily activities nowadays. While enjoying the convenience provided by LBSs, users may lose privacy since they report their personal information to the untrusted LBS server. Although many approaches have been proposed to preserve users’ privacy, most of them just focus on the user’s location privacy, but do not consider the query privacy. Moreover, many existing approaches rely heavily on a trusted third-party (TTP) server, which may suffer from a single point of failure. To solve the problems above, in this paper we propose a Cache-Based Privacy-Preserving (CBPP) solution for users in LBSs. Different from the previous approaches, the proposed CBPP solution protects location privacy and query privacy simultaneously, while avoiding the problem of TTP server by having users collaborating with each other in a mobile peer-to-peer (P2P) environment. In the CBPP solution, each user keeps a buffer in his mobile device (e.g., smartphone) to record service data and acts as a micro TTP server. When a user needs LBSs, he sends a query to his neighbors first to seek for an answer. The user only contacts the LBS server when he cannot obtain the required service data from his neighbors. In this way, the user reduces the number of queries sent to the LBS server. We argue that the fewer queries are submitted to the LBS server, the less the user’s privacy is exposed. To users who have to send live queries to the LBS server, we employ the l-diversity, a powerful privacy protection definition that can guarantee the user’s privacy against attackers using background knowledge, to further protect their privacy. Evaluation results show that the proposed CBPP solution can effectively protect users’ location and query privacy with a lower communication cost and better quality of service.

Principles of Advanced Database Integrity Checking

2005 ◽  
pp. 2297-2302
Author(s):  
Hendrik Decker
Keyword(s):  
Knowledge Representation ◽  
Predicate Logic ◽  
Declarative Knowledge ◽  
Integrity Constraints ◽  
Database Integrity ◽  
Integrity Checking ◽  
Semantic Correctness ◽  
Formal Representations

Integrity constraints (hereafter, sometimes simply ‘constraints’) are formal representations of conditions for the semantic correctness of database records. In science, constraints are usually expressed in declarative knowledge representation languages such as datalog or predicate logic. In commercial databases, they are usually expressed by distinguished SQL statements.

scholarly journals Punishers Benefit From Third-Party Punishment in Fish: Fig. 1

Science ◽  
2010 ◽  
Vol 327 (5962) ◽  
pp. 171-171 ◽  
Author(s):  
Nichola J. Raihani ◽  
Alexandra S. Grutter ◽  
Redouan Bshary
Keyword(s):  
Animal Species ◽  
Evolutionary Dynamics ◽  
Female Partner ◽  
Third Party ◽  
Complex Behavior ◽  
Group Level ◽  
Labroides Dimidiatus ◽  
Individual Level ◽  
Nonhuman Species ◽  
Shed Light

In cases where uninvolved bystanders pay to punish defectors, this behavior has typically been interpreted in terms of group-level rather than individual-level benefits. Male cleaner fish, Labroides dimidiatus, punish their female partner if she cheats while inspecting model clients. Punishment promotes female cooperation and thereby yields direct foraging benefits to the male. Thus, third-party punishment can evolve via self-serving tendencies in a nonhuman species, and this finding may shed light on the evolutionary dynamics of more complex behavior in other animal species, including humans.

Sign in / Sign up

Export Citation Format

Share Document