Approximating CSG trees of moving objects
The Visual Computer: International Journal of Computer Graphics
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A practical evaluation of kinetic data structures
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Query operations for moving objects database systems
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing Mobile Objects on the Plane
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Understanding usability in mobile commerce
Communications of the ACM - Mobile computing opportunities and challenges
Mix Zones: User Privacy in Location-aware Services
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
Bluetooth and WAP push based location-aware mobile advertising system
Proceedings of the 2nd international conference on Mobile systems, applications, and services
An Authorization Model for Geospatial Data
IEEE Transactions on Dependable and Secure Computing
Proceedings of the 6th international conference on Mobile data management
Spatial security policies for mobile agents in a sentient computing environment
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
Efficient security policy enforcement for the mobile environment
Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
Spatiotemporal Access Control Enforcement under Uncertain Location Estimates
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Efficient security policy enforcement in a location based service environment
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
A unified index structure for efficient enforcement of spatiotemporal authorisations
International Journal of Information and Computer Security
Efficient enforcement of security policies based on tracking of mobile users
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
A map-layer-based access control model
WISA'11 Proceedings of the 12th international conference on Information Security Applications
| Hi-index | 0.00 |
Often, enforcing security incurs overhead, and as a result may degrade the performance of a system. In this paper, we attempt to address this problem in the context of enforcing access control policies in a mobile data object environment. There are a number of applications that call for fine-grained specification of security policies in guaranteeing the confidentiality of data or privacy of individuals in a mobile environment. In particular, the security policies state the rules for providing controlled access to the mobile user profiles, to their current location and movement trajectories, to mobile resources, and stationary resources based on the mobile user location. Either a subject or an object in an authorization specification can be a moving object. The access requests in such an environment can typically be based on past, present and future status of the moving objects. To effectively serve such access requests, one must efficiently organize the mobile objects as well as authorizations. Although implementation of authorizations as access control list, capability list or access matrix is suitable for traditional data, it is not suitable to search mobile object authorizations as they are based on spatial and temporal attributes of subjects and objects, rather than subject and object identifiers. When a subject issues an access request, the system must first retrieve the relevant objects from the moving object database, and then verify whether there exists an authorization that allows the subject to access these objects. Since both the moving objects and authorizations are spatiotemporal in nature, for efficient processing of access requests, it is essential that they both be organized using some index structures. As a result, processing an access request requires searching two indexes – one, the moving object index, and the other, the authorization index. To improve the response time of access requests, in this paper, we propose a unified index structure, called STPR-tree to index both moving objects and authorizations that govern access to them. As a result of the unified index, access requests can be processed in one pass, thereby improving the response time. Note that current access control systems do not use any index for authorizations; our work is a step in this direction. We show how the STPR-tree can be constructed and maintained, and provide algorithms to process access requests.