An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy
IEEE Transactions on Computers
Cryptographic implementation of a tree hierarchy for access control
Information Processing Letters
Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Flexible Access Control with Master Keys
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Secure Group Communications Using Key Graphs
Secure Group Communications Using Key Graphs
Research: Dynamic key management schemes for access control in a hierarchy
Computer Communications
Key management for content access control in a hierarchy
Computer Networks: The International Journal of Computer and Telecommunications Networking
Slander-resistant forwarding isolation in ad hoc networks
International Journal of Mobile Network Design and Innovation
Secure group instant messaging using cryptographic primitives
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
A cryptographic solution for general access control
ISC'05 Proceedings of the 8th international conference on Information Security
An efficient key management scheme for content access control for linear hierarchies
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Secure group communication with hierarchical access control refers to a scenario where a group of members is divided into a number of subgroups located at different privilege levels and a high-level subgroup can receive and decrypt messages within any of its descendant lower-level subgroups; but the converse is not allowed. In this paper, we propose a new scheme CRTHACS, which is based on the Chinese Remainder Theorem. The scheme not only enables secure hierarchical control but also provides the following properties: hiding of hierarchy and receivers, authentication of both senders and messages, and a mechanism for the receiver to directly derive the key of a message.