Pirate Evolution

  • Aggelos KiayiasEmail author
  • Serdar Pehlivanoglu
Part of the Advances in Information Security book series (ADIS, volume 52)


In Chapter 4 we put forth the notion of winnable revocation games. Winning a sequence of such games implies that the adversary can be eventually disabled by the tracer. Nevertheless, the fact that the adversary can be disabled does not necessarily imply that a certain leaking incident, i.e., an incident where some key material of some users are exposed to the adversary, can be simultaneously contained. This is due to the fact that a leaking incident enables possibly the creation of a sequence of adversaries that may have to be successively revoked (in a succession of many revocation games). This gives rise to the notion of an evolving adversary which is the subject of this chapter.


Short Path Steiner Tree Single Traitor Bibliographic Note Polynomial Time Adversary 
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.


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

  1. 1.Department of Informatics and Telecommunications PanepistimiopolisNational and Kapodistrian University of AthensAthensGreece
  2. 2.Division of Mathematical Sciences School of Physical and Mathematical SciencesNanyang Technological UniversitySingaporeSingapore

Personalised recommendations