Skip to main navigation Skip to search Skip to main content

A collusion resilient key management scheme for multi-dimensional scalable media access control

  • SUNY Buffalo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

This paper proposes a novel key management scheme for multi-dimensional scalable multimedia access control. We build up a collusion-attack model and prove that the proposed scheme is indeed resilient to collusion attack. The lower bound of number of the segment keys is also given in the analysis. We consider the key management problem on partially order set and propose a general approach consists of a poset decomposition step and an element projection step. Under the proposed framework, a novel hierarchical 3D poset decomposition approach is further developed. The proposed scheme is the first provable collusion resilient scheme in 3-dimension (and higher) scenario. It can be easily adapted to other scalable dependence structure and higher dimension. Analysis on the proposed scheme proves its collusion-resilient property.

Original languageEnglish
Title of host publicationICIP 2011
Subtitle of host publication2011 18th IEEE International Conference on Image Processing
Pages2769-2772
Number of pages4
DOIs
StatePublished - 2011
Event2011 18th IEEE International Conference on Image Processing, ICIP 2011 - Brussels, Belgium
Duration: Sep 11 2011Sep 14 2011

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference2011 18th IEEE International Conference on Image Processing, ICIP 2011
Country/TerritoryBelgium
CityBrussels
Period09/11/1109/14/11

Keywords

  • access control
  • collusion attack resilience
  • key management
  • oneway hash function
  • Scalable media

Fingerprint

Dive into the research topics of 'A collusion resilient key management scheme for multi-dimensional scalable media access control'. Together they form a unique fingerprint.

Cite this