How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Communications of the ACM
How to (Really) Share a Secret
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
Reputation-based framework for high integrity sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Ultra-low power data storage for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Catch Me (If You Can): Data Survival in Unattended Sensor Networks
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Towards in-situ data storage in sensor databases
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
| Hi-index | 0.00 |
In recently popularized unattended wireless sensor networks, sensed data are stored locally or some designated nodes for a long term and retrieved sometime by collectors on demand. Such data may be delete or modified as sensor nodes are always exposed to risks such as random failure and mobile adversary. To maximize the data survival, we propose a secure and efficient scheme - MSS. MSS makes use of hopbounded computational secret sharing to achieve fault tolerance and compromise resilience, and takes advantages of multi-level secret sharing to mitigate communication overhead and improve overall security. MSS has the most advantages in terms of security and efficiency among presented schemes, as justified by our analysis.