Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Examining Smart-Card Security under the Threat of Power Analysis Attacks
IEEE Transactions on Computers
A temporal key management scheme for secure broadcasting of XML documents
Proceedings of the 9th ACM conference on Computer and communications security
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
Security of Chien's Efficient Time-Bound Hierarchical Key Assignment Scheme
IEEE Transactions on Knowledge and Data Engineering
An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription
Proceedings of the 14th ACM international conference on Information and knowledge management
Merging: An Efficient Solution for a Time-Bound Hierarchical Key Assignment Scheme
IEEE Transactions on Dependable and Secure Computing
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Controlling access to published data using cryptography
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Enforcing the security of a time-bound hierarchical key assignment scheme
Information Sciences: an International Journal
Hi-index | 0.00 |
A time-bound hierarchical key assignment scheme is a cryptographic key assignment scheme that organizes and encrypts the resources, according to the hierarchical tree relations and the time constraint, such that only authorized users can efficiently access the resources This paper proposes a practical time-bound key assignment scheme, which is efficient and is proved secure We, based on the time-bound hierarchical key assignment scheme and XML security, design and implement a new E-newspaper publication The new system owns the practical merits: (1) the server can broadcast its publications with minimized communication overhead; (2) the subscribers, with only few set up data, can access to those authorized publications; (3) the system can efficiently manage and sell some of its backlogs, according to buyer's interests in specific categories of publications over a specific time periods The experiment shows that the new system greatly improves both the efficiency of the server and the clients.