A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy
IEEE Transactions on Knowledge and Data Engineering
Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy
IEEE Transactions on Knowledge and Data Engineering
Efficient Time-Bound Hierarchical Key Assignment Scheme
IEEE Transactions on Knowledge and Data Engineering
Provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 13th ACM conference on Computer and communications security
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
On replacing cryptographic keys in hierarchical key management systems
Journal of Computer Security - The Third IEEE International Symposium on Security in Networks and Distributed Systems
New constructions for provably-secure time-bound hierarchical key assignment schemes
Theoretical Computer Science
Variations on a theme by Akl and Taylor: Security and tradeoffs
Theoretical Computer Science
Enforcing non-hierarchical access policies by hierarchical key assignment schemes
Information Processing Letters
Efficient multi-dimensional key management in broadcast services
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Provably secure key assignment schemes from factoring
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Incorporating temporal capabilities in existing key management schemes
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Simple, efficient and strongly KI-Secure hierarchical key assignment schemes
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
| Hi-index | 0.00 |
Conventional hierarchical key assignment schemes have not been concerned with a practical situation: Users might be assigned to a class for only a period of time. When a user leaves a class, the keys of that class and all the descendent classes must be renewed. For applications where the privileges of users change frequently or where there are many users, the communication load for key redistributions is very large. Recently, Tzeng [9] proposed a time-bound hierarchical key assignment scheme to address this issue. However, Tzeng's scheme was very complex and suffered from a collusion attack. In this paper, we propose an efficient time-bound scheme based on a technique called merging. The idea behind merging is to consider primitive keys instead of hierarchies. It is conceptually like the compression used in source coding. Through this technique, it is feasible to combine multiple keys into an aggregate key. Thus, communication and storage requirements are greatly reduced. This technique can also be used for an alternative implementation of Akl-Taylor's scheme. Moreover, it can be used to construct a systematic approach for adjusting hierarchies in Akl--Taylor's scheme as well. Through the insights gained from these exercises, we may see that some problems that are usually addressed by the conventional key assignment schemes can be solved directly via merging, with better performance. Furthermore, if other suitable merging functions are found in the future, new secure hierarchical key assignment schemes and time-bound schemes will be obtained accordingly.