Sciweavers

STOC
2003
ACM
142views Algorithms» more  STOC 2003»
15 years 23 days ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos