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
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
Terra: a virtual machine-based platform for trusted computing
Garfinkel, T., Pfaff, B., Chow, J., Rosenblum, M., & Boneh, D. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945464 · Cited by 887
Dynamic 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
A Signature Scheme with Efficient Protocols
Camenisch, J., & Lysyanskaya, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36413-7_20 · Cited by 662
Self-citationPractical Verifiable Encryption and Decryption of Discrete Logarithms
Camenisch, J., & Shoup, V. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_8 · Cited by 541
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
Security Models and Requirements for Healthcare Application Clouds
Zhang, R., & Liu, L. (2010) · 2010 IEEE 3rd International Conference on Cloud Computing · doi:10.1109/cloud.2010.62 · Cited by 391
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
Property-based attestation for computing platforms: caring about properties, not mechanisms
Sadeghi, A.-R., & Stüble, C. (2005) · Proceedings of the 2004 workshop on New security paradigms - NSPW '04 · doi:10.1145/1065907.1066038 · Cited by 371
Structure-Preserving Signatures and Commitments to Group Elements
Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., & Ohkubo, M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_12 · Cited by 354
A Review on the State-of-the-Art Privacy-Preserving Approaches in the e-Health Clouds
Abbas, A., & Khan, S. U. (2014) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2014.2300846 · Cited by 331
A Threshold Anonymous Authentication Protocol for VANETs
Shao, J., Lin, X., Lu, R., & Zuo, C. (2016) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2405853 · Cited by 317
Threshold Ring Signatures and Applications to Ad-hoc Groups
Bresson, E., Stern, J., & Szydlo, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_30 · Cited by 311
Secret handshakes from pairing-based key agreements
Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., & Wong, H.-C. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199336 · Cited by 286
Anonymous Identification in Ad Hoc Groups
Dodis, Y., Kiayias, A., Nicolosi, A., & Shoup, V. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_36 · Cited by 284
Chase, M., & Lysyanskaya, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_5 · Cited by 253
Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities
Brickell, E., & Li, J. (2012) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2011.63 · Cited by 91
Short Threshold Dynamic Group Signatures
Camenisch, J., Drijvers, M., Lehmann, A., Neven, G., & Towa, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-57990-6_20 · Cited by 59
Self-citation
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.