New constructions for provably-secure time-bound hierarchical key assignment schemes

Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT

Volumn , Issue , 2007, Pages 133-138

  De Santis, Alfredo ^a   Ferrara, Anna Lisa ^a   Masucci, Barbara ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Access control; Key assignment; Provable security

Indexed keywords

COMPUTER PRIVACY; DATA STRUCTURES; HIERARCHICAL SYSTEMS; INFORMATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

HIERARCHICAL KEY ASSIGNMENT; KEY ASSIGNMENT; PROVABLE SECURITY;

ACCESS CONTROL;

EID: 34548050702     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1266840.1266861     Document Type: Conference Paper

References (24)

1. S. G. Akl and P. D. Taylor, Cryptographic Solution to a Problem of Access Control in a Hierarchy, ACM Trans. on Comp. Sys., 1(3), 239-248, 1983.
2. N. Alon and B. Schieber, Optimal Preprocessing for Answering On-line Product Queries, Tech. Rep. TR 71/87, Inst, of Comp. Science, Tel-Aviv Univ., 1987.
3. M. J. Atallah, M. Blanton, N. Fazio, and K. B. Frikken, Dynamic and Efficient Key Management for Access Hierarchies, CERIAS Tech. Rep. TR 2006-09, Purdue Univ. Prelim, version in Proc. of the 12th ACM Conf. on Computer and Communications Security - CCS 2005, 190-201.
4. M. J. Atallah, M. Blanton, and K. B. Frikken, Key Management for Non-Tree Access Hierarchies, in Proc. of the 11th ACM Symp. on Access Control Models and Technologies -SACMAT 2006, 11-18.
5. G. Ateniese, A. De Santis, A. L. Ferrara, and B. Masucci, Provably-Secure Time-Bound Hierarchical Key Assignment Schemes, in Proc. of the 13th ACM Conf. on Computer and Communications Security - CCS 2006, 288-297. Full version available as Report 2006/225 at the IACR Cryptology ePrint Archive.
6. H. L. Bodlaender, G. Tel, and N. Santoro, Trade-offs in Non-reversing Diameter, Nordic J. on Comput., 1, 111-134, 1994.
7. D. Boneh, C. Gentry, and B. Waters, Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys, in Proc. of Crypto 2005, LNCS, 3621, 258-275.
8. H. Y. Chien, Efficient Time-Bound Hierarchical Key Assignment Scheme, IEEE Trans. on Knowl. and Data Eng., 16(10), 1301-1034, 2004.
9. J. Crampton, K. Martin, and P. Wild, On Key Assignment for Hierarchical Access Control, in Proc. of the 19th IEEE Computer Security Foundations Workshop - CSFW 2006, 98-111.
10. A. De Santis, A. L. Ferrara, and B. Masucci, Enforcing the Security of a Time-Bound Hierarchical Key Assignment Scheme, Inf. Sci., 176(12), 1684-1694, 2006.
11. A. De Santis, A. L. Ferrara, and B. Masucci, Efficient Provably-Secure Hierarchical Key Assignment Schemes, available as Report 2006/479 at the IACR Cryptology ePrint Archive.
12. A. De Santis, A. L. Ferrara, and B. Masucci, New Constructions for Provably-Secure Time-Bound Hierarchical Key Assignment Schemes, available as Report 2006/483 at the IACR Cryptology ePrint Archive.
13. B. Dushnik and E. W. Miller, Partially Ordered Sets, American Journal of Mathematics, 63, 600-610, 1941.
14. H. F. Huang and C. C. Chang, A New Cryptographic. Key Assignment Scheme with Time-Constraint Access Control in a Hierarchy, Comp. Standards & Interfaces 26, 159-166, 2004.
15. Q. Tang and C. J. Mitchell, Comments on a Cryptographic Key Assignment Scheme, Comp. Standards & Interfaces, 27, 323-326, 2005.
16. R. E. Tarjan, Efficiency of a Good but not Linear Set Union Algorithm, Journal of the ACM, 22, 215-225, 1975.
17. M. Thorup, Shortcutting Planar Digraphs, DIMACS Tech. Rep. 93-60, August 1993.
18. W.-G. Tzeng, A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy, IEEE Trans. on Knowl. and Data Eng., 14(1), 182-188, 2002.
19. W.-G. Tzeng, A Secure System for Data Access Based on Anonymous and Time-Dependent Hierarchical Keys, in Proc. of the ACM Symp. on Information, Computer and Communications Security - ASIACCS 2006, 223-230.
20. A. C. Yao, Space-Time Tradeoff for Answering Range Queries, in Proc. of the 14th annual ACM Symp. on the Theory of Computing - STOC 1982, 128-136.
21. J. Yeh, An RSA-Based Time-Bound Hierarchical Key Assignment Scheme for Electronic Article Subscription, in Proc. of the ACM Int. Conf. on Inf. and Knowl. Management -CIKM 2005, 285-286.
22. X. Yi, Security of Chien's Efficient Time-Bound Hierarchical Key Assignment Scheme, IEEE Trans. on Knowl. and Data Eng., 17(9), 1298-1299, 2005.
23. X. Yi and Y. Ye, Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy, IEEE Trans. on Knowl. and Data Eng., 15(4), 1054 -1055, 2003.
24. S.-Y. Wang and C.-Laih, Merging: An Efficient Solution for a Time-Bound Hierarchical Key Assignment Scheme, IEEE Trans. on Dep. and Secure Coinput., 3(1), 2006.