Classify Encrypted Data in Wireless Sensor Networks

• Main Authors: WU, Yongdong, MA, Di, LI, Tieyan, DENG, Robert H.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2004
• Subjects: Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/532; http://dx.doi.org/10.1109/VETECF.2004.1404660
• Institution: Singapore Management University

End-to-end security mechanisms, like SSL, may seriously limit the capability of in-network processing that is the most critical function in sensor networks. Supporting in-network processing can significantly improve the performance of extremely resource-constrained sensor networks featuring many-to-one traffic patterns. How to protect the traffic and support in-network processing at the same time is an open problem. The paper tackles the problem by proposing a model for categorizing encrypted messages in wireless sensor networks. A classifier, an intermediate sensor node in our setting, is embedded with a set of searching keywords in encrypted format. Upon receiving an encrypted message, it matches the message with the keywords and then processes the message based on certain policies such as forwarding the original message to the next hop, updating and forwarding it or simply dropping it on detecting a duplicate. The messages are encrypted before being sent out and decrypted only at their destinations. Although the intermediate classifiers can categorize the messages, except for several encrypted keywords, they learn nothing about the encrypted messages, not even statistical information. The scheme is efficient, flexible and resource saving. The performance analysis shows that the computational cost and communication cost are minimized. Furthermore, it is resilient to node capture attack and many other kinds of attacks. We are prototyping the model on our mote testbed.