Efficient security policy enforcement for the mobile environment
Efficient security policy enforcement for the mobile environment
复制标题
移动环境的高效安全策略实施
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Jaideep Vaidya
中科院分区：
文献类型：
--
作者：
V. Atluri;Heechang Shin;Jaideep Vaidya
在过去的十年里，移动通信在全球范围内获得了前所未有的增长。包括全球定位系统(GPS)和射频识别(RFID)在内的移动通信技术最近的进步推动了一些移动服务的增长。通常，这些需要维护移动对象的位置和简档信息，并有效地服务关于移动对象的过去、现在和未来状态的访问请求。这就带来了固有的安全和隐私挑战。解决此问题的一种方法是指定安全策略以确保受控访问。然而，这会显著降低系统性能。为了缓解这一问题，Atluri和Guo提出了一种统一的索引结构--S TPR-树，用于组织移动对象和指定的权限。这种方法的一个重要局限性是不能存储对象的过去位置信息，因此不能支持基于移动用户跟踪的安全策略。本文提出了一种新的统一索引结构，称为S PPF-树，它通过使用部分持久存储来维护移动对象的过去、现在和未来的位置以及授权。除了演示如何构建和维护S PPF-树之外，我们还提供了处理主体和/或客体都是移动的查询的算法。我们提供了一个全面的实验评估，以确定我们的方法的可扩展性和性能。
In the last decade, mobile communication has enjoyed unprecedented growth all over the world. The recent advances in mobile communication technologies including Global Positioning System (GPS) and Radio Frequency Identification (RFID) have propelled the growth of a number of mobile services. Typically, these require maintaining the mobile objects’ location and profile information and efficiently serving access requests on the past, present and future status of the moving objects. This creates inherent security and privacy challenges. One solution to this is to specify security policies to ensure controlled access. However, this significantly degrades system performance. To alleviate this, Atluri and Guo have proposed an unified index structure, S TPR-tree, to organize both the moving objects and authorizations specified over them. A significant limitation of this approach is that it is unable to store past location information of objects and is therefore not capable of supporting security policies based on tracking of mobile users. In this paper, we propose a new unified index structure, called the S PPF -tree, which maintains past, present and future positions of the moving objects along with authorizations by employing partial persistent storage. Besides demonstrating how the S PPF -tree can be constructed and maintained, we provide algorithms to process queries where either the subject or the object or both are mobile. We provide a comprehensive experimental evaluation to establish the scalability and performance of our approach.