PL EN
REVIEW PAPER
GENERALIZED ACCESS STRUCTURES WITH HIERARCHY
 
 
More details
Hide details
1
Uniwersytet Warszawski
 
 
Publication date: 2014-12-05
 
 
SBN 2014;6(2): 299-316
 
KEYWORDS
ABSTRACT
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.
 
2.
D. Boneh, M. Franklin, Identity-Based Encryption from the Weil Pairing, SIAM J. of Computing, Vol. 32, No. 3, pp. 586–615, 2003.
 
3.
Announcing the Advanced Encryption Standard (AES) Federal Information Processing Standards Publication 197, United States National Institute of Standards and Technology (NIST). November 26, 2001.
 
4.
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.
 
5.
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).
 
6.
A. Shamir, How to share a secret, Communications of the ACM, Volume 22 Issue 11, Nov. 1979, 612–613.
 
7.
J. H Silverman, it The Arithmetic of Elliptic Curves, 2nd Edition, Springer (2009).
 
8.
L. C. Washington, Elliptic curves. Number theory and Cryptography, Chapman & Hall/CRC(2003).
 
ISSN:2082-2677
Journals System - logo
Scroll to top