A novel e-newspapers publication system using provably secure time-bound hierarchical key assignment scheme and XML security

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chien, H. Y., Chen, Y. L., Lo, C. F., & Huang, Y. M. (2010). A novel e-newspapers publication system using provably secure time-bound hierarchical key assignment scheme and XML security. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6104 LNCS, pp. 407–417). https://doi.org/10.1007/978-3-642-13067-0_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free