The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
Abstract
In this paper, we investigate combinatorial properties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital fingerprinting and traceability schemes for broadcast encryption. We first give combinatorial descriptions of these two objects in terms of set systems and also discuss the Hamming distance of frameproof codes when viewed as error-correcting codes. From these descriptions, it is seen that existence of a c-traceability scheme implies the existence of a c-frameproof code. We then give several constructions of frameproof codes and traceability schemes by using combinatorial structures such as t-designs, packing designs, error-correcting codes, and perfect hash families. We also investigate embeddings of frameproof codes and traceability schemes, which allow a given scheme to be expanded at a later date to accommodate more users. Finally, we look briefly at bounds which establish necessary conditions for existence of these structures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
CRC Handbook of Combinatorial Designs
(1996) · Discrete Mathematics and Its Applications · doi:10.1201/9781420049954 · Cited by 1,738
van Lint, J. H., & Wilson, R. M. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511987045 · Cited by 1,185
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
Electronic marking and identification techniques to discourage document copying
Brassil, J. T., Low, S., Maxemchuk, N. F., & O'Gorman, L. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464718 · Cited by 369
Chor, B., Fiat, A., & Naor, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_25 · Cited by 366
Collusion-Secure Fingerprinting for Digital Data
Boneh, D., & Shaw, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_36 · Cited by 289
Shadow bounds for self-dual codes
Rains, E. M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651000 · Cited by 237
Alon, N., & Naor, M. (1996) · Algorithmica · doi:10.1007/bf01940874 · Cited by 142
Cited by
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
Collusion-secure fingerprinting for digital data
Boneh, D., & Shaw, J. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705568 · Cited by 980
Traitor Tracing with Constant Transmission Rate
Kiayias, A., & Yung, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_30 · Cited by 675
Chor, B., Fiat, A., Naor, M., & Pinkas, B. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841169 · Cited by 304
Efficient Trace and Revoke Schemes
Naor, M., & Pinkas, B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_1 · Cited by 298
Metadata
- Authors
- Stinson, D. R., & Wei, R.
- Venue
- SIAM Journal on Discrete Mathematics
- Published
- 1998-02
- Volume
- 11
- Issue
- 1
- Pages
- 41-53
- ISSN
- 0895-4801 (ISSN-L)
- 1095-7146
- OpenAlex
- W2002087984
- Cited by
- 275
- References
- 10
- FWCI
- 13.57
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes. https://app.cochat.ai/papers/10.1137/s0895480196304246
- The paper
- Stinson, D. R., & Wei, R. (1998). Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/s0895480196304246
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.