The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Threshold Ring Signatures and Applications to Ad-hoc Groups
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
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
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
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Self-citationPerkins, C. E. (2008) · Cited by 1,889
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
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
Authenticated Key Exchange Secure against Dictionary Attacks
Bellare, M., Pointcheval, D., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_11 · Cited by 1,503
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
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
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
Alon, N., Yuster, R., & Zwick, U. (1995) · Journal of the ACM · doi:10.1145/210332.210337 · Cited by 1,002
A 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
Untraceable Off-line Cash in Wallet with Observers
Brands, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_26 · Cited by 507
Practical multi-candidate election system
Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., & Poupard, G. (2001) · Proceedings of the twentieth annual ACM symposium on Principles of distributed computing · doi:10.1145/383962.384044 · Cited by 301
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
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
Some Open Issues and New Directions in Group Signatures
Ateniese, G., & Tsudik, G. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48390-x_15 · Cited by 173
On monotone formula closure of SZK
Santis, A. D., Crescenzo, G. D., Persiano, G., & Yung, M. M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365745 · Cited by 131
Publicly verifiable lotteries: Applications of delaying functions
Goldschlag, D. M., & Stubblebine, S. G. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055485 · Cited by 75
Proofs of partial knowledge and simplified design of witness hiding protocols
Cramer, R., Damgård, I., & Schoenmakers, L. B. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 56
Threshold Ring Signatures and Applications to Ad-hoc Groups (Full version)
Bresson, E., Stern, J., & Szydlo, M. (2002) · International Cryptology Conference · Cited by 44
Self-citationFair e-Lotteries and e-Casinos
Eyal Kushilevitz, Z., & Rabin, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45353-9_9 · Cited by 24
Cited by
Li, L., Liu, J., Cheng, L., Qiu, S., Wang, W., Zhang, X., & Zhang, Z. (2018) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2017.2777990 · Cited by 571
Pseudonym Schemes in Vehicular Networks: A Survey
Petit, J., Schaub, F., Feiri, M., & Kargl, F. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2345420 · Cited by 434
Accumulators 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
Privacy-Preserving Solutions for Blockchain: Review and Challenges
Bernal Bernabe, J., Canovas, J. L., Hernandez-Ramos, J. L., Torres Moreno, R., & Skarmeta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2950872 · Cited by 459
“[122], where t out of n private keys are needed for a valid signature, etc.”
BackgroundLinkable 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
- Bresson, E., Stern, J., & Szydlo, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 465-480
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1638799436
- Cited by
- 311
- References
- 29
- FWCI
- 9.79
- 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.