Abstract
A time-bound hierarchical key assignment scheme is a cryptographic key assignment scheme that organizes and encrypts the resources, according to the hierarchical tree relations and the time constraint, such that only authorized users can efficiently access the resources. This paper proposes a practical time-bound key assignment scheme, which is efficient and is proved secure. We, based on the time-bound hierarchical key assignment scheme and XML security, design and implement a new E-newspaper publication. The new system owns the practical merits: (1) the server can broadcast its publications with minimized communication overhead; (2) the subscribers, with only few set up data, can access to those authorized publications; (3) the system can efficiently manage and sell some of its backlogs, according to buyer’s interests in specific categories of publications over a specific time periods. The experiment shows that the new system greatly improves both the efficiency of the server and the clients.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akl, S.G., Taylor, P.D.: Cryptographic Solution to a Problem of Access Control in a hierarchy. ACM Trans. on Computer Systems 1(3), 239–248 (1983)
Chen, T.-S., Huang, J.-Y.: A novel key management scheme for dynamic access control in a user hierarchy. Applied Mathematics and Computation 162, 339–351 (2005)
Chien, H.-Y., Jan, J.-K.: New hierarchical assignment without Public Key cryptography. Computer and Security 22(6), 523–526 (2003)
Chien, H.-Y.: Efficient time-bound hierarchical key assignment scheme. IEEE Trans. on Knowledge and Data Eng. 16(10), 1301–1304 (2004)
Chien, H.-Y., Tang, Y.-L., Chen, Y.-L.: A Secure and Efficient Time-Bound Hierarchical Key Assignment Scheme. In: Proc. of the 2007 IAENG International Conference on Communication Systems and Applications, Hong Kong, pp. 21–23 (2007)
Gemplus, M.L.: Smart-Cards: A Cost-Effective Solution against Electronic Fraud. In: Proc. European Conf. Security and Detection, pp. 81–85 (1997)
Huang, H.-F., Chang, C.-C.: A new cryptographic key assignment scheme with time-constraint access control in a hierarchy. Computer Standards and Interfaces 26(3), 159–166 (2004)
Lee, W.-B., Li, J.-H., Dow, C.-R.: Efficient Date-Constraint Hierarchical Key Assignment Scheme. In: Proc. of the 2005 International Conf. on Security and Management, Las Vegas, Nevada, USA, pp. 51–57 (2005)
De Santis, A., Ferrara, A.L., Masucci, B.: Enforcing the security of a time-bound hierarchical key assignment scheme. Information Sciences 176, 1684–1694 (2006)
Tzeng, W.-G.: A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy. IEEE Trans. Knowledge and Data Eng. 14(1), 182–188 (2002)
Tzeng, W.-G.: Access control and authorization: A secure system for data access based on anonymous authentication and time-dependent hierarchical keys. In: Proc. ACM Symposium on Information, computer and comm. Security, Taiwan, pp. 223–230 (2006)
Wang, S.-Y., Laih, C.-S.: Merging: An Efficient Solution for a Time-Bound Hierarchical Key Assignment Scheme. IEEE Trans. on Dependable and Secure Computing 3(1), 91–100 (2006)
World Wide Web Consortium. Extensible Markup Language (XML) 1.0 (1998), http://www.w3.org/TR/REC-xml/
World Wide Web Consortium. XML Encryption Syntax and Processing (2002a), http://www.w3.org/TR/xmlenc-core/
World Wide Web Consortium. XML-Signature Syntax and Processing (2002b), http://www.w3.org/TR/xmldsig-core/
Yeh, J.-H.: An RSA-Based Time-Bound Hierarchical Key Assignment Scheme for Electronic Article Subscription. In: Proc. ACM Conf. Information and Knowledge Management, pp. 285–286 (2005)
Yi, X., Ye, Y.: Security of Tzeng’s time-bound key assignment scheme for access control in a hierarchy. IEEE Trans. on Knowledge and Data Eng. 15(4), 1054–1055 (2003)
Yi, X.: Security of Chien’s efficient time-bound hierarchical key assignment scheme. IEEE Trans. on Knowledge and Data Eng. 17(9), 1298–1299 (2005)
Messerges, T.S., Dabbish, E.A., Sloan, R.H.: Examining smart-card security under the threat of power analysis attacks. IEEE Transactions on Computers 51(5), 541–552 (2002)
Bellare, M., Rogaway, P.: Provably secure session key distribution: The three party case. In: 27th ACM Symposium on the Theory of Computing, pp. 57–66. ACM Press, New York (1995)
Bertino, E., Carminati, B., Ferrari, E.: A temporal key management scheme for secure broadcasting of XML documents. In: ACM Conference on Computer and Communications Security, pp. 31–40 (2002)
Miklau, G., Suciu, D.: Controlling Access to Published Data Using Cryptography. In: Proc. of the 29th international conference on Very large data bases, VLDB, pp. 898-909 (2003)
Chen, Y.L.: Application and Design of Time-Bound Hierarchical Key Assignment Scheme, thesis, ChaoYang University of Technology, Department of Information Management (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chien, HY., Chen, YL., Lo, CF., Huang, YM. (2010). A Novel E-Newspapers Publication System Using Provably Secure Time-Bound Hierarchical Key Assignment Scheme and XML Security. In: Bellavista, P., Chang, RS., Chao, HC., Lin, SF., Sloot, P.M.A. (eds) Advances in Grid and Pervasive Computing. GPC 2010. Lecture Notes in Computer Science, vol 6104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13067-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-13067-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13066-3
Online ISBN: 978-3-642-13067-0
eBook Packages: Computer ScienceComputer Science (R0)