The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
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
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
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Self-citationEfficient group signature schemes for large groups: Extended abstract
Camenisch, J., & Stadler, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052252 · Cited by 1,083
Self-citationA Practical and Provably Secure Coalition-Resistant Group Signature Scheme
Ateniese, G., Camenisch, J., Joye, M., & Tsudik, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_16 · Cited by 800
Self-citationRethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Brands, S. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/5931.001.0001 · Cited by 685
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Barić, N., & Pfitzmann, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_33 · Cited by 557
Lysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46513-8_14 · Cited by 521
Self-citationStatistical zero knowledge protocols to prove modular polynomial relations
Fujisaki, E., & Okamoto, T. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052225 · Cited by 497
Secure Hash-and-Sign Signatures Without the Random Oracle
Gennaro, R., Halevi, S., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_9 · Cited by 347
Composition and integrity preservation of secure reactive systems
Pfitzmann, B., & Waidner, M. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352639 · Cited by 277
On the generation of cryptographically strong pseudorandom sequences
Shamir, A. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357357 · Cited by 268
Efficient and Generalized Group Signatures
Camenisch, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_32 · Cited by 257
Self-citationNew group signature schemes: Extended abstract
Chen, L., & Pedersen, T. P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053433 · Cited by 237
Quasi-Efficient Revocation of Group Signatures
Ateniese, G., Song, D., & Tsudik, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36504-4_14 · Cited by 215
Kilian, J., & Petrank, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055727 · Cited by 199
Separability and Efficiency for Generic Group Signature Schemes
BRICS, Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_27 · Cited by 182
Self-citationPractical forward secure group signature schemes
Song, D. X. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502015 · Cited by 175
Efficient Revocation in Group Signatures
Bresson, E., & Stern, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44586-2_15 · Cited by 164
A Group Signature Scheme with Improved Efficiency (Extended Abstract)
Camenisch, J. L., & Michels, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-49649-1_14 · Cited by 106
Self-citationAn Integer Commitment Scheme based on Groups with Hidden Order.
Damgård, I., & Fujisaki, E. (2001) · Cited by 86
Goldreich, O., Micali, S. M., & Wigderson, A. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_11 · Cited by 82
An Identity Escrow Scheme with Appointed Verifiers
Camenisch, J. L., & Lysyanskaya, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_23 · Cited by 47
Self-citation
Cited by
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Miers, I., Garman, C., Green, M., & Rubin, A. D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.34 · Cited by 983
Brickell, E., Camenisch, J., & Chen, L. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030103 · Cited by 935
Self-citationAccumulators from Bilinear Pairings and Applications
Nguyen, L. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_19 · Cited by 431
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Groth, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11935230_29 · Cited by 390
Metadata
- Authors
- Camenisch, J., & Lysyanskaya, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 61-76
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1607188293
- Cited by
- 732
- References
- 24
- FWCI
- 14.14
- 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.
