In many application scenarios for pervasive computing, theft is a serious security threat. In this paper we present the All-Or-Nothing anti-theft policy aimed at providing theft protection for pervasive computing. The overall idea behind the All-Or-Nothing anti-theft policy is to chain devices together in friendly networks so that any device will only work when it can see all of its friends. Thus a thief will have to keep the network of friendly devices together even if he only desires to steal one of the devices. Otherwise the device will not work. We provide a detailed security policy, present the required cryptographic protocols, provide three different applications, and finally we document that the policy is suitable for implementation on typical pervasive computing devices.
Proceedings of Aina Workshops, 2007, p. 626-631
Main Research Area:
International Conference on Advanced Information Networking and Applications, 2007