Variations on a theme by Akl and Taylor: Security and tradeoffs

Theoretical Computer Science

Volumn 411, Issue 1, 2010, Pages 213-227

  D'Arco, Paolo ^a   De Santis, Alfredo ^a   Ferrara, Anna Lisa ^a   Masucci, Barbara ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Access control; Efficiency; Key assignment; Provable security

Indexed keywords

ASSIGNMENT STRATEGIES; CRYPTOGRAPHIC TECHNIQUES; DIFFERENT DOMAINS; EFFICIENCY REQUIREMENTS; HIERARCHICAL STRUCTURES; INDISTINGUISHABILITY; KEY ASSIGNMENT; KEY ASSIGNMENT SCHEMES; KEY RECOVERY; NEW RESULTS; PROVABLE SECURITY; PUBLIC INFORMATION; RIGOROUS ANALYSIS; TIME-DEPENDENT CONSTRAINTS;

COMPUTER CONTROL SYSTEMS; HIERARCHICAL SYSTEMS; MARKUP LANGUAGES; MOBILE AGENTS; NETWORK SECURITY; SECURITY SYSTEMS;

ACCESS CONTROL;

EID: 71749111864     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.09.028     Document Type: Article

References (23)

1. Akl S.G., and Taylor P.D. Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Comput. Syst. 1 3 (1983) 239-248
2. T. Asano, A revocation scheme with minimal storage at receivers, advances in cryptology, in: Proc. of ASIACRYPT 2002, 2002, pp. 433-450
3. Atallah M.J., Blanton M., Fazio N., and Frikken K.B. Dynamic and efficient key management for access hierarchies. ACM Trans. Inf. Syst. Secur. 12 3 (2009) Article 18, Prelim. version in Proc. of ACM CCS 2005, 190-201
4. G. Ateniese, A. De Santis, A.L. Ferrara, B. Masucci, Provably-secure time-bound hierarchical key assignment schemes, Rep. 2006/225 at the IACR Cryptology ePrint Archive. Prelim. version in Proc. of ACM CCS 2006, pp. 288-297
5. N. Attrapadung, K. Kobara, Broadcast encryption with short keys and transmissions, in: Proc. of the 3rd ACM workshop on Digital Rights Management, 2003, pp. 55-66
6. J. Crampton, Applying hierarchical and role-based access control to XML documents, in Proc. of ACM SWS 2004, pp. 37-46
7. De Santis A., Ferrara A.L., and Masucci B. Cryptographic key assignment schemes for any access control policy. Inf. Proc. Lett. 92 4 (2004) 199-205
8. A. De Santis, A.L. Ferrara, B. Masucci, Efficient provably-secure hierarchical key assignment schemes, Rep. 2006/479 at the IACR Cryptology ePrint Archive. Prelim. version in Proc. of MFCS 2007, LNCS 4708, pp. 371-382
9. Erdo{double acute}s P., and Pomerance C. On the normal number of prime factors of φ{symbol} (n). Rocky Mountain J. Math. 15 (1985) 343-352
10. Goldreich O. Foundations of Cryptography - Basic Tools (2001), Cambridge Univ. Press, Cambridge, UK
11. O. Goldreich, L. Levin, A hard-core predicate for all one-way functions, in: Proc. of ACM STOC 1989, pp. 25-32
12. Goldwasser S., and Micali S. Probabilistic encryption. J. Comput. Syst. 28 (1984) 270-299
13. Hardy G.H., and Wright E.M. An Introduction to the Theory of Numbers. 5th ed (1979), Clarendon Press, Oxford, England
14. Harn L., and Lin H.Y. A cryptographic key generation scheme for multilevel data security. Comput. Security 9 6 (1990) 539-546
15. Khachiyan L. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 24 (1979) 1093-1096
16. Lin I.-C., Oub H.-H., and Hwang M.-S. Efficient access control and key management schemes for mobile agents. Comput. Stand. Interfaces 26 5 (2004) 423-433
17. MacKinnon S.J., Taylor P.D., Meijer H., and Akl S.G. An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Trans. Comput. C-34 9 (1985) 797-802
18. M.O. Rabin, Digitalized Signatures and Public Key Functions as Intractable as Factorization, Tech. Rep. MIT/LCS/TR-212, MIT Lab. for Computer Science, 1979
19. Rivest R.L., Shamir A., and Adleman L. A method for obtaining digital signatures and public key cryptosystems. Commun. ACM 21 (1978) 120-126
20. Shamir A. On the generation of cryptographically strong pseudorandom sequences. ACM Trans. Comput. Syst. 1 (1983) 38-44
21. W.-G. Tzeng, A secure system for data access based on anonymous and time-dependent hierarchical keys, in: Proc. of ACM ASIACCS 2006, pp. 223-230
22. J.H. Yeh, R. Chow, R. Newman, A key assignment for enforcing access control policy exceptions, in: Proc. of Int. Symposium on Internet Technology, 1998, pp. 54-59
23. Wang S.-Y., and Laih C.-S. Merging: An efficient solution for a time-bound hierarchical key assignment scheme. IEEE Trans. Dependable Secure Comput. 3 1 (2006)