A cryptographic key assignment scheme for access control in poset ordered hierarchies with enhanced security

International Journal of Network Security

Volumn 7, Issue 2, 2008, Pages 223-234

  Giri, Debasis ^a   Srivastava, Parmeshwary Dayal ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Access control; Cryptography; Data security; Key generation

Indexed keywords

CRYPTOGRAPHIC ASSUMPTIONS; CRYPTOGRAPHIC KEY ASSIGNMENT; CRYPTOGRAPHIC TECHNIQUES; HIERARCHICAL STRUCTURES; INFORMATION ITEMS; KEY GENERATION;

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

ACCESS CONTROL;

EID: 80054086407     PISSN: 1816353X     EISSN: 18163548     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. S. G. Akl and P. D. Taylor, "Cryptographic solution to a problem of access control in a hierarchy," ACM Transactions on Computer Systems, vol. 1, no. 2, pp. 239-248, 1983.
2. M. Ben-Or, "Probabilistic algorithms in finite fields," 22nd IEEE Anual Symposiam on Foundations of Computer Science (FOCS'81), pp. 394-398, 1981.
3. C. C. Chang, R. J. Hwang, and T. C. Wu, "Cryptographic key assignment scheme for access control in a hierarchy," Information Systems, vol. 17, no. 3, pp. 243-247, 1992.
4. H. Cohen, A Course In computational Algebraic Number Theory, Springer-Verleg, 1991.
5. D. E. Denning, S. G. Akl, M. Morgenstern, P. G. Neumann, R. R. Schell, and M. Heckman, "Views for multilevel database security," Proceeding of the IEEE Symposium on Security and Privacy, pp. 156-172, Oakland, 1986.
6. L. J. Fraim, "SCOMP: A solution to the multilevel security problem," IEEE Computer, vol. 16, no.7, pp. 26-34, 1983.
7. L. Harn, and H. Y. Lin, "A cryptographic key generation scheme for multilevel data security," Computers and Security, vol. 9, no. 6, pp. 539-546, 1990.
8. C. L. Hus and T. S. Wu, "Crypanalysis and inprovements of two cryptographic key assignment schemes for dynamic access control in a user hierarchy," Computers and Security, vol. 22, no. 5, pp. 453-456, 2003.
9. M. S. Hwang, "An asymmetric cryptographic key assignment scheme for access control in totally-ordered hierarchies," International Journal Computer Mathematics, vol. 73, pp. 463-468, 2000.
10. E. Keltofen and V. Shoup, "Subquadratic-time factoring of polynomials over finite fields," Mathematics of Computations, vol. 67, no. 223, pp. 1179-1197, 1998.
11. B. LaMacchia, and A. M. Odlyzko, "Computation of discrete logarithms in finite fields," advanced in Cryptology (CRYPTO'90), pp. 616-618, 1991.
12. A. K. Lenstra and M. S. Manasse, "Factoring by electronic mail," advanced in Cryptology (EUROCRYPT'89), pp. 355-371, 1990.
13. H. T. Liaw and C. L. Lei, "An Optimal algorithm to assign cryptographic keys in a tree structure for access control," BIT, vol. 33, pp. 46-56, 1993.
14. H. T. Liaw, S. J. Wang, and C. L. Lei, "An dynamic cryptographic key assignment scheme in a tree structure," Computers and Mathematics with Applications, vol. 25, no. 6, pp. 109-114, 1993.
15. I. C. Lin, M. S. Hwang, and C. C. Chang, "A new key assignment scheme for enforcing complicated access control policies in hierarchy," Future Generation Computer Systems, vol. 19, no. 4, pp. 457-462, 2003.
16. W. P. Lu and M. K. Sundareshan, "Enhanced protocols for hierarchical encryption key management for secure communication in internet environments," IEEE Transactions on Communications, vol. 40, no. 4, pp. 658-660, 1992.
17. S. J. Mackinnon, P. D. Taylor, H. Meijer, and S. G. Akl, "An optimal algorithm for assigning cryptographic keys to control access in a hierarchy," IEEE Transactions on Computers, vol. 34, no. 9, pp. 797-802, 1985.
18. K. S. McCurley, "The discrete logarithm problem," Proceedings of Symposia in Applied Mathematical Society, vol. 42, pp. 49-74, 1990.
19. J. McHugh, and A. P. Moore, "A security policy and formal top level specification for a multi-level secure local area network," Proceeding of the IEEE Symposium on Security and Privacy, pp. 34-39, 1986.
20. National Institute of Standards and Technology, Advanced Encryption Standard, Federal Information Processing Standard (FIPS) 197, Nov. 26, 2001.
21. National Institute of Standards and Technology, Secure Hash Standard, Federal Information Processing Standard (FIPS) 180-2, Aug. 2002.
22. A. M. Odlyzko, "Discrete logarithms in finite fields and their cryptographics significance," Cryptology (EUROCRYPT'89), pp. 224-314, 1990.
23. C. Pomerance, "Analysis and comparison of some integer factoring algorithms," Computational Methods in Number Theory, vol. 154, pp. 89-139, 1982.
24. C. Pomerance, "Factoring," in Proceedings of Symposia in Applied Mathematics, vol. 42, pp. 27-48, 1990.
25. M. O. Rabin, Digitalized Signatures And Public-Key Functions As Intractable As Factorization, Technical Report MIT/LCS/TR- 212, Laboratory for Computer Science, Massaachusetts Institute of Technology, Cambridge, Mass, 1979.
26. R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, vol. 21, no. 2, pp. 637-647, 1978.
27. R. S. Sandhu, "Cryptographic implimentation of a tree hierarchy for access control," Information Processing Letters, vol. 27, pp. 95-98, 1988.
28. J. B. Scarborough, Numerical Mathematical Analysis, Oxford and IBH publishing Co. Pvt. Ltd., 1966.
29. B. Schneier, Applied Cryptography, Second edition, John Wiley and Sons, New York, 1996.
30. V. R. L. Shen and T. S. Chen, "A novel key management scheme based on discrete logarithms and polynomial interpolations," Computers and Security, vol. 21, no. 2, pp. 167-171, 2002.
31. S-Y. Wang and C. S. Laih, "Crypanalysis of two key assignment schemes based on polynomial interpolations," Computers and Security, vol. 24, pp. 134-138, 2005.
32. T. C. Wu and C. C. Chang, "Cryptographic key assignment scheme for hierarchical access control," International Journal of Computer Systems Science and Engineering, vol. 16, no. 1, pp. 25-28, 2001.