Fingerprinting Capacity Under the Marking Assumption

@article{Anthapadmanabhan2007FingerprintingCU,
  title={Fingerprinting Capacity Under the Marking Assumption},
  author={N. Anthapadmanabhan and A. Barg and I. Dumer},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2007},
  pages={706-710}
}
We study the maximum attainable rate or capacity of fingerprinting codes under the marking assumption. It is proved that capacity for fingerprinting against coalitions of size two and three over the binary alphabet satisfies 0.25 les C2,2 les 0.322 and 0.083 les C3,2 les 0.199 respectively. For coalitions of an arbitrary fixed size, we derive a closed-form upper bound on fingerprinting capacity in the binary case. Finally, for general alphabets, we establish upper bounds on the fingerprinting… Expand
Asymptotic Fingerprinting Capacity for Non-binary Alphabets
Universal fingerprinting: Capacity and random-coding exponents
  • P. Moulin
  • Computer Science, Mathematics
  • 2008 IEEE International Symposium on Information Theory
  • 2008
High rate fingerprinting codes and the fingerprinting capacity
Two-level fingerprinting codes
Capacity-achieving fingerprint decoding
  • Yen-Wei Huang, P. Moulin
  • Computer Science
  • 2009 First IEEE International Workshop on Information Forensics and Security (WIFS)
  • 2009
Randomized frameproof codes: Fingerprinting plus validation minus tracing
Equal-Weight Fingerprinting Codes
Tree search for digital fingerprinting
Fingerprinting With Minimum Distance Decoding
Toward Practical Joint Decoding of Binary Tardos Fingerprinting Codes
  • P. Meerwald, T. Furon
  • Computer Science
  • IEEE Transactions on Information Forensics and Security
  • 2012
...
1
2
3
4
...

References

SHOWING 1-10 OF 31 REFERENCES
Random Binary Fingerprinting Codes for Arbitrarily Sized Coalitions
Digital fingerprinting codes: problem statements, constructions, identification of traitors
Random coding technique for digital fingerprinting codes: fighting two pirates revisited
  • G. Blakley, G. Kabatiansky
  • Computer Science
  • International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
  • 2004
On the capacity game of private fingerprinting systems under collusion attacks
Collusion-Secure Fingerprinting for Digital Data
Collusion-Secure Fingerprinting for Digital Data
Codes with the Identifiable Parent Property and the Multiple-Access Channel
On Codes with the Identifiable Parent Property
Combinatorial properties of frameproof and traceability codes
An elementary proof of the strong converse theorem for the multiple-access channel
...
1
2
3
4
...