Scalable Key Management Algorithms for Location-Based Services

被引:5
作者
Srivatsa, Mudhakar [1 ]
Iyengar, Arun [1 ]
Yin, Jian [1 ]
Liu, Ling [2 ]
机构
[1] IBM TJ Watson Res Ctr, Yorktown Hts, NY 10598 USA
[2] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
关键词
Access control; key management; location-based services (LBS); scalability and performance;
D O I
10.1109/TNET.2008.2010222
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 (x(bl), y(bl), x(tr), y(tr)) 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 and 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.
引用
收藏
页码:1399 / 1412
页数:14
相关论文
共 29 条
  • [1] AGUILERA K, 2000, P 19 ACM PODC, P209
  • [2] [Anonymous], 0755 NETW ASS INC TI
  • [3] ATALLAH M, 2007, P 2007 ACM S INF COM, P82
  • [4] Atallah M.J., 2005, P ACM C COMPUTER COM, P190
  • [5] Atallah MJ, 2007, LECT NOTES COMPUT SC, V4734, P515
  • [6] ATENIESE G, 2006, P 13 ACM C COMP COMM, P288
  • [7] Boneh D, 2005, LECT NOTES COMPUT SC, V3621, P258
  • [8] Briscoe B, 1999, LECT NOTES COMPUT SC, V1736, P301
  • [9] Multicast security: A taxonomy and some efficient constructions
    Canetti, R
    Garay, J
    Itkis, G
    Micciancio, D
    Naor, M
    Pinkas, B
    [J]. IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, : 708 - 716
  • [10] Canetti R, 1999, LECT NOTES COMPUT SC, V1592, P459