The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Efficient Trace and Revoke Schemes
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
ElGamal, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_2 · Cited by 1,604
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
A practical scheme for non-interactive verifiable secret sharing
Feldman, P. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.4 · Cited by 1,125
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
Fiat, A., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_40 · Cited by 728
Self-citationChor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
Self-citationA 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
Pseudorandomness and Cryptographic Applications
Luby, M. (1996) · Princeton University Press eBooks · doi:10.1515/9780691206844 · Cited by 374
Chor, B., Fiat, A., & Naor, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_25 · Cited by 366
Self-citationNumber-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646134 · Cited by 353
Self-citationAn Efficient Public Key Traitor Tracing Scheme
Boneh, D., & Franklin, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_22 · Cited by 293
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
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
Optimum traitor tracing and asymmetric schemes
Kurosawa, K., & Desmedt, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054123 · Cited by 170
Digital signets: self-enforcing protection of digital information (preliminary version)
Dwork, C., Lotspiech, J. B., & Naor, M. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237997 · Cited by 88
Self-citationA Quick Group Key Distribution Scheme with “Entity Revocation”
Anzai, J., Matsuzaki, N., & Matsumoto, T. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48000-6_27 · Cited by 82
Cited by
Attribute-based encryption with non-monotonic access structures
Ostrovsky, R., Sahai, A., & Waters, B. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315270 · Cited by 1,059
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
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
The LSD Broadcast Encryption Scheme
Halevy, D., & Shamir, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_4 · Cited by 411
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
Attrapadung, N., Libert, B., & de Panafieu, E. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_6 · Cited by 377
Metadata
- Authors
- Naor, M., & Pinkas, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 1-20
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1596144702
- Cited by
- 298
- References
- 22
- FWCI
- 9.61
- Type
- conference paper
- 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.