Group signature schemes and payment systems based on the discrete logarithm problem
Open accessThe DOI matches its OpenAlex record.
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
Cited by
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
“Our protocols use zero-knowledge proofs that can be instantiated using the technique of Schnorr [18], with extensions due to e.g., [19] [20] [21] [22].”
MethodA 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-citationA 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-citationCamenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
Self-citationProving 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-citationAn Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Camenisch, J., Kohlweiss, M., & Soriente, C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_27 · Cited by 288
Self-citationAu, M. H., Susilo, W., & Mu, Y. (2006) · Lecture Notes in Computer Science · doi:10.1007/11832072_8 · Cited by 287
Attribute-based signature and its applications
Li, J., Au, M. H., Susilo, W., Xie, D., & Ren, K. (2010) · Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security · doi:10.1145/1755688.1755697 · Cited by 279
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
“The technique we use is a minor variation of the SKLOGLOG (proof of knowledge of double discrete logarithm) proposed by Camenisch [ Cam98 ], Stadler [Stad96] and Camenisch/Stadler [CS97].”
BackgroundMethod
Metadata
- Authors
- Camenisch, J. L.
- Venue
- CERN Document Server (European Organization for Nuclear Research)
- Publisher
- European Organization for Nuclear Research
- Published
- 1998-01-01
- OpenAlex
- W1538706266
- Cited by
- 170
- References
- 0
- FWCI
- 6.13
- Type
- journal article
- Language
- en
- Open access
- green
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.