Advertisement

Collusion Detection and Resolution

  • Anne V. D. M. Kayem
  • Selim G. Akl
  • Patrick Martin
Chapter
Part of the Advances in Information Security book series (ADIS, volume 48)

Abstract

The problem of protecting against attacks perpetrated by valid users in possession of “correct” keys, is one that all cryptographic key management schemes aim to prevent. In this chapter, we consider an attack type, termed a “collusion attack”, that can be provoked by users in possession of valid keys. A collusion attack occurs when two or more users at the same level in the hierarchy collaboratively compute (using a contrived mathematical function), from their respective keys, a key (higher up in the hierarchy) to which they are not entitled. Collusion detection and resolution is an important issue in guaranteeing the security of any key management scheme because it enables the scheme to enforce precautionary measures against collusion attacks which can be carried out by users in possession of valid keys. We propose a method of addressing this problem that is based on the concept of maximum dispersion.

Keywords

Data Encryption Great Common Divisor Covert Channel Collusion Attack Security Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Anne V. D. M. Kayem
    • 1
  • Selim G. Akl
    • 2
  • Patrick Martin
    • 2
  1. 1.Department of Computer ScienceCape TownSouth Africa
  2. 2.School of ComputingQueen’s UniversityKingstonCanada

Personalised recommendations