The Geometry of Uncertainty in Moving Objects Databases
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
WLAN Location Determination via Clustering and Probability Distributions
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Evaluating probabilistic queries over imprecise data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Location-Aided Planning in Mobile Network—Trial Results
Wireless Personal Communications: An International Journal
An Authorization Model for Geospatial Data
IEEE Transactions on Dependable and Secure Computing
GEO-RBAC: a spatially aware RBAC
Proceedings of the tenth ACM symposium on Access control models and technologies
Proceedings of the 6th international conference on Mobile data management
Indexing multi-dimensional uncertain data with arbitrary probability density functions
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Access control to people location information
ACM Transactions on Information and System Security (TISSEC)
Supporting location-based conditions in access control policies
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Efficient indexing methods for probabilistic threshold queries over uncertain data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A geotemporal role-based authorisation system
International Journal of Information and Computer Security
Query answering techniques on uncertain and probabilistic data: tutorial summary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
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)
Location privacy protection through obfuscation-based techniques
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
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 spatio-temporal role-based access control model
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Unified index for mobile object data and authorizations
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Survey of Wireless Indoor Positioning Techniques and Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
AccKW: an efficient access control scheme for keyword-based search over RDBMS
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Enabling secure location-based services in mobile cloud computing
Proceedings of the second ACM SIGCOMM workshop on Mobile cloud computing
Hi-index | 0.00 |
In a mobile environment, user's physical location plays an important role in determining access to resources. However, because current moving object databases do not keep the exact location of the moving objects, but rather maintain their approximate location for reasons of minimizing the updates, the access request evaluation cannot always guarantee the intended access control policy requirements. This may be risky to the system's security, especially for the highly sensitive resources. In this paper, we introduce an authorization model that takes the uncertainty of location measures into consideration for specifying and evaluating access control policies. An access request is granted only if the confidence level of the location predicate exceeds the predefined uncertainty threshold level specified in the policy. However, this access request evaluation is computationally expensive as it requires to evaluate a location predicate condition and may also require evaluating the entire moving object database. For reducing the cost of evaluation, in this paper, we compute lower and upper bounds (R min and R max ) on the region that minimize the region to be evaluated thereby allowing unneeded moving objects to be discarded from evaluation. We show how R min and R max can be computed and maintained, and provide algorithms to process access requests.