The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Efficient and Generalized Group Signatures
Open accessOverview
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
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
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
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
Chaum, D., & van Heyst, E. (1991) · Theory and Application of Cryptographic Techniques · Cited by 1,492
Wallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292
Chaum, D., & van Heyst, E. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_22 · Cited by 1,196
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_19 · Cited by 1,152
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
An Optimal Class of Symmetric Key Generation Systems
Blom, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_22 · Cited by 933
(1991) · Lecture notes in computer science · doi:10.1007/3-540-46416-6 · Cited by 725
(1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5 · Cited by 681
Generalized Secret Sharing and Monotone Functions
Benaloh, J., & Leichter, J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_3 · Cited by 677
(1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4 · Cited by 661
Proxy signatures for delegating signing operation
Mambo, M., Usuda, K., & Okamoto, E. (1996) · Proceedings of the 3rd ACM conference on Computer and communications security - CCS '96 · doi:10.1145/238168.238185 · Cited by 584
Advances in Cryptology-Eurocrypt '96
Maurer, U. M. (1996) · Cited by 582
Robust Threshold DSS Signatures
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_31 · Cited by 427
Advances in Cryptology — CRYPTO’ 88
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2 · Cited by 415
New group signature schemes: Extended abstract
Chen, L., & Pedersen, T. P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053433 · Cited by 237
A digital multisignature scheme based on the Fiat-Shamir scheme
Ohta, K., & Okamoto, T. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1_11 · Cited by 104
Advances in Cryptology — ASIACRYPT '91
Brandt, J., Damgård, I., & Landrock, P. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1 · Cited by 81
Cited by
Rivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619
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-citationDynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Camenisch, J., & Lysyanskaya, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_5 · Cited by 732
Self-citationBellare, M., Micciancio, D., & Warinschi, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_38 · Cited by 732
Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups
Liu, J. K., Wei, V. K., & Wong, D. S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27800-9_28 · Cited by 405
Metadata
- Authors
- Camenisch, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- Pages
- 465-479
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1763199136
- Cited by
- 257
- References
- 21
- FWCI
- 8.29
- 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
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.