The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Chaum, D., & van Heyst, E. (1991) · Theory and Application of Cryptographic Techniques · Cited by 1,492
Chaum, D., & van Heyst, E. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_22 · Cited by 1,196
Efficient 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-citationThe Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
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
Statistical 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
Optimistic fair exchange of digital signatures: Extended abstract
Asokan, N., Shoup, V., & Waidner, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054156 · Cited by 305
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_8 · Cited by 299
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
Kilian, J., & Petrank, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055727 · Cited by 199
Group blind digital signatures: A scalable solution to electronic cash
Lysyanskaya, A., & Ramzan, Z. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055483 · Cited by 186
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-citationGroup signature schemes and payment systems based on the discrete logarithm problem
Camenisch, J. L. (1998) · CERN Document Server (European Organization for Nuclear Research) · doi:10.3929/ethz-a-001923735 · Cited by 170
Self-citationA practical and provably secure scheme for publicly verifiable secret sharing and its applications
Fujisaki, E., & Okamoto, T. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054115 · Cited by 139
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-citationA Group Signature Scheme Based on an RSA-Variant
Camenisch, J. L., & Michels, M. (1998) · BRICS Report Series · doi:10.7146/brics.v5i27.19433 · Cited by 96
Self-citationVerifiable Encryption and Applications to Group Signatures and Signature Sharing
Camenisch, J. L., & Damgård, I. (1998) · BRICS Report Series · doi:10.7146/brics.v5i32.19438 · Cited by 37
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
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-citationSignature Schemes and Anonymous Credentials from Bilinear Maps
Camenisch, J., & Lysyanskaya, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_4 · Cited by 982
Self-citationBrickell, 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-citationGSIS: A Secure and Privacy-Preserving Protocol for Vehicular Communications
Lin, X., Sun, X., Ho, P.-H., & Shen, X. (2007) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2007.906878 · Cited by 917
Metadata
- Authors
- Ateniese, G., Camenisch, J., Joye, M., & Tsudik, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 255-270
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2135656098
- Cited by
- 800
- References
- 22
- FWCI
- 14.09
- 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.