Welcome to the resource topic for 2013/132
Yet Another Attack On the Chinese Remainder Theorem Based Hierarchical Access Control Scheme
Authors: Niu Liu, Shaohua Tang, Lingling XuAbstract:
The hierarchical access control scheme based on Chinese Reminder Theorem  (CRTHACS) was supposed to be capable of hiding hierarchical structure, but Geiselmann et al.  showed practical attacks on CRTHACS to reveal the hierarchies it hides. Then, Zou et al. modified it, and gave a new CRTHACS  to resist those attacks. Nevertheless, we find that the modified version is still defective if it permits changes of structure, i.e. the scheme works in a dynamic scenario. In this paper, we describe our attack on the modified version of CRTHACS. We extend the description of the CRTHACS in a more proper form making it easier for us to look into the problem it has. We find the key character of the vulnerability which we name as double-invariance. We generalize our attack in an algebraic form and apply it to a series of hierarchical cryptographic access control schemes that share the same vulnerability with CRTHACS. We also give the countermeasure to fix this vulnerability.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .