The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
An Efficient Public Key Traitor Tracing Scheme
Open accessOverview
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
Self-citationA new public-key cryptosystem as secure as factoring
Okamoto, T., & Uchiyama, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054135 · Cited by 673
Chor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
Chor, B., Fiat, A., & Naor, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_25 · Cited by 366
Incremental Cryptography: The Case of Hashing and Signing
Bellare, M., Goldreich, O., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_22 · Cited by 312
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
Cited by
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
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
Coercion-resistant electronic elections
Juels, A., Catalano, D., & Jakobsson, M. (2005) · Proceedings of the 2005 ACM workshop on Privacy in the electronic society · doi:10.1145/1102199.1102213 · Cited by 414
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
- Boneh, D., & Franklin, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 338-353
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1560252361
- Cited by
- 293
- References
- 13
- FWCI
- 10.75
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: An Efficient Public Key Traitor Tracing Scheme. https://app.cochat.ai/papers/10.1007/3-540-48405-1_22
- The paper
- Boneh, D., & Franklin, M. (1999). An Efficient Public Key Traitor Tracing Scheme. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-48405-1_22
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.