Caching Content under Digital Rights Management

Authors:
Leah Epstein;Amos Fiat;Meital Levy
Affiliations:
Department of Mathematics, University of Haifa, Haifa, Israel 31905;School of Computer Science, Tel-Aviv University, Israel;School of Computer Science, Tel-Aviv University, Israel
Venue:
Approximation and Online Algorithms
Year:
2009

Citing 7
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
New results on server problems

SIAM Journal on Discrete Mathematics
Online computation and competitive analysis

Online computation and competitive analysis
Online paging and file caching with expiration times

Theoretical Computer Science
Digital rights management for content distribution

ACSW Frontiers '03 Proceedings of the Australasian information security workshop conference on ACSW frontiers 2003 - Volume 21
Digital Rights Management: Technological, Economic, and Legal and Political Aspects (Lecture Notes in Computer Science, 2770)

Digital Rights Management: Technological, Economic, and Legal and Political Aspects (Lecture Notes in Computer Science, 2770)
Randomized competitive algorithms for generalized caching

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Digital rights management systems seek to control the use of proprietary material (e.g., copyrighted movies). The use of DRM introduces a new set of caching issues not previously studied. Technically, these problems include elements of ski rental algorithms as well as paging, and their generalizations, online "capital investment" and generalized caching (the Landlord algorithm). The introduction of DRM restrictions does not impact the competitive ratio by more than a constant factor.