loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)
The All-or-Nothing Anti-Theft Policy--Theft Protection for Pervasive Computing
Niagara Falls, Ontario, Canada
May 21-May 23
ISBN: 0-7695-2847-3
Jakob Illeborg Pagter, The Alexandra Institute Ltd., Denmark
Michael Ostergaard Pedersen, University of Aarhus, Denmark
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.

Citation:
Jakob Illeborg Pagter, Michael Ostergaard Pedersen, "The All-or-Nothing Anti-Theft Policy--Theft Protection for Pervasive Computing," ainaw, vol. 1, pp.626-631, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.