Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Role-Based Access Control Models
Computer
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Providing Database as a Service
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Dynamic and efficient key management for access hierarchies
Proceedings of the 12th ACM conference on Computer and communications security
Key management for non-tree access hierarchies
Proceedings of the eleventh ACM symposium on Access control models and technologies
On Key Assignment for Hierarchical Access Control
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Efficient techniques for realizing geo-spatial access control
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
New constructions for provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 12th ACM symposium on Access control models and technologies
Efficient provably-secure hierarchical key assignment schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Incorporating temporal capabilities in existing key management schemes
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Efficient multi-dimensional key management in broadcast services
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Practical and efficient cryptographic enforcement of interval-based access control policies
ACM Transactions on Information and System Security (TISSEC)
Bounded vector signatures and their applications
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
| Hi-index | 0.00 |
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions include latitude, longitude, and time. One way of distributing the data consists of making freely available encrypted versions of selected subsets of the data, and giving each paying customer the decryption keys for their authorized subsets only. In this work, we give efficient key management schemes to balance the number of keys assigned to a customer, and its time to derive the appropriate key for decrypting the data.