Access structures are used in cases associated with situations when one or
more entities are trying to get a resource. We will present a generalization to the case
of access structures many resources, which allows for a nice description of thresholds
and hierarchical schemes. We will also present the use of the so-called bilinear product,
defined in the group of n-torsion points of an elliptic curve over a finite field on two
exemplary hierarchical allocation key schemes.
REFERENCES(8)
1.
M. J. Atallah, M. Blanton, N. Fazio, K. B. Frikken, Dynamic and Efficient Key Management for Access Hierarchies, ACM Transactions on Information and System Security, Vol. 12, No. 3, Article 18, January 2009.
Announcing the Advanced Encryption Standard (AES) Federal Information Processing Standards Publication 197, United States National Institute of Standards and Technology (NIST). November 26, 2001.
C-H Liu, Y-F Chung, T-S Chen, S-D Wang, An Id-based Access Control In A Hierarchical Key management For Mobile Agent, International Journal of Innovative Computing, Information and Control Volume 7, Number 3, March 2011.
S. J. MacKinnon, P. D. Taylor, H. Meijer, S. G. Akl, An Optimal Algorithm for assigning cryptographic keys to control access in a Hierarchy, IEEE Transactions on Computers, vol C-34, no. 9 (1985).
We process personal data collected when visiting the website. The function of obtaining information about users and their behavior is carried out by voluntarily entered information in forms and saving cookies in end devices. Data, including cookies, are used to provide services, improve the user experience and to analyze the traffic in accordance with the Privacy policy. Data are also collected and processed by Google Analytics tool (more).
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.