Sciweavers

Share
8 search results - page 1 / 2
» Lower bounds for collusion-secure fingerprinting
Sort
View
CORR
2006
Springer
176views Education» more  CORR 2006»
8 years 12 months ago
On the Fingerprinting Capacity Under the Marking Assumption
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya...
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
9 years 1 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
SIGMOD
2003
ACM
142views Database» more  SIGMOD 2003»
9 years 12 months ago
Winnowing: Local Algorithms for Document Fingerprinting
Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, incl...
Saul Schleimer, Daniel Shawcross Wilkerson, Alexan...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
10 years 3 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
CCS
2006
ACM
9 years 3 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo
books