The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Collusion-secure fingerprinting for digital data
Abstract
This paper discusses methods for assigning code-words for the purpose of fingerprinting digital data, e.g., software, documents, music, and video. Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy and trace it back to the user. This threat of detection will deter users from releasing unauthorized copies. A problem arises when users collude: for digital data, two different fingerprinted objects can be compared and the differences between them detected. Hence, a set of users can collude to detect the location of the fingerprint. They can then alter the fingerprint to mask their identities. We present a general fingerprinting solution which is secure in the context of collusion. In addition, we discuss methods for distributing fingerprinted data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
van Lint, J. H. (1982) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-07998-0 · Cited by 668
Chor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
Families of finite sets in which no set is covered by the union ofr others
Erdös, P., Frankl, P., & Füredi, Z. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02772959 · Cited by 440
A secure, robust watermark for multimedia
Cox, I. J., Kilian, J., Leighton, T., & Shamoon, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_41 · Cited by 422
Chor, B., Fiat, A., Naor, M., & Pinkas, B. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841169 · Cited by 304
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
Stinson, D. R., & Wei, R. (1998) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480196304246 · Cited by 275
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Alon, N., Bruck, J., Naor, J., Naor, M., & Roth, R. M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119713 · Cited by 257
Embedding secret information into a dithered multi-level image
Tanaka, K., Nakamura, Y., & Matsui, K. (2002) · IEEE Conference on Military Communications · doi:10.1109/milcom.1990.117416 · Cited by 165
Cited by
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Multimedia watermarking techniques
Hartung, F., & Kutter, M. (1999) · Proceedings of the IEEE · doi:10.1109/5.771066 · Cited by 1,363
Revocation and Tracing Schemes for Stateless Receivers
Naor, D., Naor, M., & Lotspiech, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_3 · Cited by 1,118
Information-theoretic analysis of information hiding
Moulin, P., & O'Sullivan, J. A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.808134 · Cited by 673
Information Forensics: An Overview of the First Decade
Stamm, M. C., Wu, M., & Liu, K. J. R. (2013) · IEEE Access · doi:10.1109/access.2013.2260814 · Cited by 394
Anti-collusion fingerprinting for multimedia
Trappe, W., Wu, M., Wang, Z. J., & Liu, K. J. R. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.809378 · Cited by 382
Moulin, P., & Koetter, R. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.859599 · Cited by 306
Chor, B., Fiat, A., Naor, M., & Pinkas, B. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841169 · Cited by 304
Metadata
- Authors
- Boneh, D., & Shaw, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 5
- Pages
- 1897-1905
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2134195444
- Cited by
- 980
- References
- 15
- FWCI
- 23.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.