SPINS: security protocols for sensor networks
Wireless Networks
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Watermarking relational data: framework, algorithms and analysis
The VLDB Journal — The International Journal on Very Large Data Bases
TinySec: a link layer security architecture for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Practical algorithm for data security (PADS) in wireless sensor networks
MobiDE '07 Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access
Resilient rights protection for sensor streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Secure Data Transmission of Wireless Sensor Network Based on Information Hiding
MOBIQUITOUS '07 Proceedings of the 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking&Services (MobiQuitous)
A Cluster-Based Watermarking Technique for Relational Database
DBTA '09 Proceedings of the 2009 First International Workshop on Database Technology and Applications
Simplified watermarking scheme for sensor networks
International Journal of Internet Protocol Technology
Query-preserving watermarking of relational databases and Xml documents
ACM Transactions on Database Systems (TODS)
Reversible watermarking using prediction error histogram and blocking
IWDW'10 Proceedings of the 9th international conference on Digital watermarking
| Hi-index | 0.00 |
This paper proposes a novel semi-fragile watermarking technique for sensor data. The proposed watermarking technique embeds the secret watermark in the order of the data readings rather than the data values themselves, thus, does not cause distortion to the transmitted data values. Transmitted data readings are organised in groups of fixed length. The watermarking algorithm then reorders data readings relative to each other according to the value of the secret watermark. The proposed scheme tolerates minor changes that might be caused by channel error. In case of a single attack, the proposed technique can identify the victim element with high probability. The paper provides detailed security analysis to show the robustness of the proposed techniques against various types of attacks. Extensive experiments are performed to measure the attack detection and victim identification rate. The execution time of the watermark embedding and integrity check is also shown.