Scalable Key Management Algorithms for Location-Based Services
Srivatsa, M.
Iyengar, A.
Jian Yin
Ling Liu
T.J. Watson Res. Center, IBM, Yorktown Heights, NY, USA;
This paper appears in: Networking, IEEE/ACM Transactions on
Publication Date: Oct. 2009
Volume: 17,
Issue: 5
On page(s): 1399-1412
ISSN: 1063-6692
INSPEC Accession Number: 10918111
Digital Object Identifier: 10.1109/TNET.2008.2010222
First Published: 2009-07-14
Current Version Published: 2009-10-13
Abstract
Secure media broadcast over the Internet poses unique security challenges. One important problem for public broadcast location-based services (LBS) is to enforce access control on a large number of subscribers. In such a system, a user typically subscribes to an LBS for a time interval (a, b) and a spatial region (xbi, ybi, xtr,ytr) according to a 3-dimensional spatial-temporal authorization model. In this paper, we argue that current approaches to access control using key management protocols are not scalable. Our proposal, STauth, minimizes the number of keys that needs to be distributed and is thus scalable to a large number of subscribers and the dimensionality of the authorization model. We also demonstrate applications of our algorithm to quantified-temporal access control (using V and 3 quantifications) and partial-order tree-based authorization models. We describe two implementations of our key management protocols on two diverse platforms: a broadcast service operating on top of a publish/subscribe infrastructure and an extension to the Google Maps API to support quality (resolution)-based access control. We analytically and experimentally show the performance and scalability benefits of our approach over traditional key management approaches.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
