@inproceedings{0228dc72a6a14b95898cf779fc966573,
title = "Capacity-achieving fingerprint decoding",
abstract = "We study randomized fingerprinting codes that achieve the fundamental capacity limits subject to the so-called Boneh-Shaw marking assumption. Two decoding schemes are studied in particular: the joint decoder is capacity-achieving but computationally intense, while the simple decoder is sub-optimal but efficient. We provide tight bounds as well as numerical results for capacities and study the difference between these two schemes. Finally, security strategies for both the fingerprint embedders and the collusive attackers are presented.",
keywords = "Capacity, Fingerprinting, Game theory, Saddle-point problems, Traitor tracing",
author = "Huang, {Yen Wei} and Pierre Moulin",
year = "2009",
doi = "10.1109/WIFS.2009.5386483",
language = "English (US)",
isbn = "9781424452804",
series = "Proceedings of the 2009 1st IEEE International Workshop on Information Forensics and Security, WIFS 2009",
pages = "51--55",
booktitle = "Proceedings of the 2009 1st IEEE International Workshop on Information Forensics and Security, WIFS 2009",
note = "2009 1st IEEE International Workshop on Information Forensics and Security, WIFS 2009 ; Conference date: 06-12-2009 Through 09-12-2009",
}