leakage identification for secret relational data using shadowed watermarks

Int Assoc Comp Sci & Informat Technol, Sichuan Comp Federat, Singapore Inst Electvarious database watermarking techniques have been developed to protect the ownership of relational data, some provide extra utilities for pirate identification. In all the proposed schemes, the data owner controls the watermark key and the watermark generation process, which makes it possible for the owner to falsely accuse an innocent user of pirating. In this paper, we propose a novel watermark scheme to solve the problem of leakage identification for secret relational data, which is a small-scaled pirate identification problem. We devise a scheme that combines two keys to generate a shadowed watermark, and we design a protocol to bind the data distribution to the identities of both the owner and the user. A user is able to prove his innocence if falsely accused, so that both parties are fairly protected. We provide probabilistic analyses for the effectiveness and security of our scheme, and we test its performance to conclude that the scheme is qualified for practical use

A Data Deduplication Scheme Based on DBSCAN With Tolerable Clustering Deviation

To protect data privacy, users prefer to store encrypted data in cloud servers. Cloud servers reduce the cost of storage and network bandwidth by eliminating duplicate copies. To address the potential internal data leakage problem, the concept of clustering deviation is proposed for the first time. We improve the DBSCAN algorithm to tolerate clustering deviation. A data deduplication scheme is built upon the new algorithm, which considers users as clustering samples. Instead of immediately re-clustering new users, a certain deviation is tolerated to assign the users to the existing classes. We determine the popularity of the data according to user clustering results and apply different encryption schemes to protect the security of unpopular data more effectively. The performance of the algorithm is analyzed and compared with other methods through experiments, and the results verify the feasibility and efficiency of the proposed deduplication scheme

towards a secure distribute storage system

Minist Informat & Commun, IEEE Commun Soc, IEEE Reg 10, Korean Inst Commun Sci, IEEK Commun Soc, Open Stand & Internet Assoc, Korea Inst Informat Scientists & Engineers, Inst Informat Technol Advancement, Korea Res Fdn, Elect & Telecommun ResTodays storage paradigm is shifting from the closed and managed mode to be more open and dynamic. Network storage system can be made up of a group of loosely coupled and heterogeneous storage resources. But this openness exposes the data dire

A Secure Random Key Distribution Scheme Against Node Replication Attacks in Industrial Wireless Sensor Systems

With the widely deployment of wireless sensor networks in smart industrial systems, lots of unauthorized attacking from the adversary is greatly threating the security and privacy of the entire industrial systems, of which node replication attacks can hardly be defended since it is conducted in the physical layer. To solve this problem, we propose a secure random key distribution scheme, called SRKD, which provides a new method for the defense against the attack. Specifically, we combine a localized algorithm with a voting mechanism to support the detection and revocation of malicious nodes. We further change the meaning of the parameter s to help prevent the replication attack. Furthermore, the experimental results show that the detection ratio of replicate nodes exceeds 90% when number of network nodes reaches 200, which demonstrates the security and effectiveness of our scheme. Compared with existing state-of-the-art schemes, SRKD also has good storage and communication efficiency