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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Kayem, A.V.D.M., Akl, S.G., Martin, P. (2010). Collusion Detection and Resolution. In: Adaptive Cryptographic Access Control. Advances in Information Security, vol 48. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6655-1_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6655-1_7
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6654-4
Online ISBN: 978-1-4419-6655-1
eBook Packages: Computer ScienceComputer Science (R0)