RANDOMISED DYNAMIC TRAITOR TRACING

Jarrod Trevathan, Wayne Read

2006

Abstract

Dynamic traitor tracing schemes are used to trace the source of piracy in broadcast environments such as cable TV. Dynamic schemes divide content into a series of watermarked segments that are then broadcast. The broadcast provider can adapt the watermarks according to the pirate’s response and eventually trace him/her. As dynamic algorithms are deterministic, for a given set of inputs, the tracing algorithm will execute exactly the same way each time. An adversary can use this knowledge to ensure that the tracing algorithm is forced into executing at its worst case bound. In this paper we review dynamic traitor tracing schemes and describe why determinism is a problem. We ammend several existing dynamic tracing algorithms by incorporating randomised decisions. This eliminates any advantage an adversary has in terms of the aforementioned attack, as he/she no longers knows exactly how the tracing algorithm will execute. Simulations show that the randomising modifications influence each dynamic algorithm to run at its average case complexity in terms of tracing time. We provide an efficiency analysis of the ammended algorithms and give some recommendations for reducing overhead.

References

  1. Berkman, O., Parnas, M. and Sgall, J. (2000). Efficient Dynamic Traitor Tracing, in 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), 586-595.
  2. Boneh, D. and Shaw, J. (1995). Collusion-Secure Fingerprinting for Digital Data, IEEE Transactions of Information Theory, vol. 44, no. 5, 452-465.
  3. Chor, B., Fiat, A. and Naor, M. (1994). Tracing Traitors, in Advances in Cryptology - Proceedings of CRYPTO 1994, vol. 839 of Lecture Notes in Computer Science, 257-270.
  4. Daemen, J. and Rijmen, V. (1998). AES Proposal: Rijndael, in First Advanced Encryption Standard (AES) Conference, Ventura, CA.
  5. Fiat, A. and Tassa, T. (1999). Dynamic Traitor Tracing, in Advances in Cryptology - Proceedings of CRYPTO 1999, vol. 773 of Lecture Notes in Computer Science, 354-371.
  6. Hoare, C. A. R. (1961). ACM Algorithm 64: Quicksort, in Communications of the ACM, 4(7):321.
  7. McIlroy, M. (1999). A Killer Adversary for Quicksort, in Software, Practice and Experience, vol. 29, 1-4.
  8. Naor, M. and Pinkas, B. (1998). Threshold Traitor Tracing, in Advances in Cryptology - Proceedings of CRYPTO 1998, vol. 1462 of Lecture Notes in Computer Science, 502-517.
  9. Pfitzmann, B. (1996). Trials of Traced Traitors, Information Hiding, vol. 1174 of Lecture Notes in Computer Science, 49-64.
  10. Safavi-Naini, R. and Wang, Y. (2000). Sequential Traitor Tracing, in Advances in Cryptology - Proceedings of CRYPTO 2000, vol. 1880 of Lecture Notes in Computer Science, 316-332.
  11. Trevathan, J., Ghodosi, H. and Litow, B. (2003). Overview of Traitor Tracing Schemes, in Communications of the CCISA, Selected Topics of Cryptography and Information Security, Taiwan, Volume 9, Number 4, 51-63.
Download


Paper Citation


in Harvard Style

Trevathan J. and Read W. (2006). RANDOMISED DYNAMIC TRAITOR TRACING . In Proceedings of the International Conference on Signal Processing and Multimedia Applications - Volume 1: SIGMAP, (ICETE 2006) ISBN 978-972-8865-64-1, pages 323-332. DOI: 10.5220/0001571203230332


in Bibtex Style

@conference{sigmap06,
author={Jarrod Trevathan and Wayne Read},
title={RANDOMISED DYNAMIC TRAITOR TRACING},
booktitle={Proceedings of the International Conference on Signal Processing and Multimedia Applications - Volume 1: SIGMAP, (ICETE 2006)},
year={2006},
pages={323-332},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001571203230332},
isbn={978-972-8865-64-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Signal Processing and Multimedia Applications - Volume 1: SIGMAP, (ICETE 2006)
TI - RANDOMISED DYNAMIC TRAITOR TRACING
SN - 978-972-8865-64-1
AU - Trevathan J.
AU - Read W.
PY - 2006
SP - 323
EP - 332
DO - 10.5220/0001571203230332