The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Compact E-Cash
Open accessOverview
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_9 · Cited by 2,448
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
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
Improved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475
Self-citationShort Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
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
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
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
Untraceable Electronic Cash: (Extended Abstract)
Chaum, D., Fiat, A., & Naor, M. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_25 · Cited by 1,120
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-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-citationRethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Brands, S. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/5931.001.0001 · Cited by 685
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-citationCollision-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
Practical 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-citationNew Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
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
Efficient Proofs that a Committed Number Lies in an Interval
Boudot, F. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_31 · Cited by 489
Optimistic fair exchange of digital signatures
Asokan, N., Shoup, V., & Waidner, M. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839935 · Cited by 480
A Verifiable Random Function with Short Proofs and Keys
Dodis, Y., & Yampolskiy, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_28 · Cited by 428
Number-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2004) · Journal of the ACM · doi:10.1145/972639.972643 · Cited by 368
Bellare, M., & Palacio, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_11 · Cited by 312
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-citationStadler, M., Piveteau, J.-M., & Camenisch, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-49264-x_17 · Cited by 245
Self-citationSupersingular Curves in Cryptography
Galbraith⋆, S. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_29 · Cited by 226
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
Damgård, I., & Fujisaki, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_8 · Cited by 221
A New Two-Party Identity-Based Authenticated Key Agreement
McCullagh, N., & Barreto, P. S. L. M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_18 · Cited by 218
Easy come — Easy go divisible cash
Chan, A., Frankel, Y., & Tsiounis, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054154 · Cited by 216
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 Signatures: Better Efficiency and New Theoretical Aspects
Camenisch, J., & Groth, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30598-9_9 · Cited by 181
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-citationCamenisch, J., & Damgård, I. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_25 · Cited by 166
Self-citationTrustee-based tracing extensions to anonymous cash and the making of anonymous change
Brickell, E., Gemmell, P. S., & Kravitz, D. W. (1995) · doi:10.5555/313651.313790 · Cited by 150
“Indirect discourse proofs”: Achieving efficient Fair Off-Line e-cash
Frankel, Y., Tsiounis, Y., & Yung, M. M. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034855 · Cited by 145
Efficient Construction of (Distributed) Verifiable Random Functions
Dodis, Y. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_1 · Cited by 122
Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number.Preprint
Scott, M. (2002) · IACR Cryptology ePrint Archive · Cited by 114
Rapid Demonstration of Linear Relations Connected by Boolean Operators
Brands, S. A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_22 · Cited by 96
Randomized algorithms in number theory
Rabin, M. O., & Shallit, J. O. (1986) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160390713 · Cited by 96
An Integer Commitment Scheme based on Groups with Hidden Order.
Damgård, I., & Fujisaki, E. (2001) · Cited by 86
Easy Decision Diffie-Hellman Groups
Galbraith⋆, S. D., & Rotger, V. (2004) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157000001108 · Cited by 70
Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme
Jarecki, S., & Shmatikov, V. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_35 · Cited by 45
Cited by
Zerocash: Decentralized Anonymous Payments from Bitcoin
Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.36 · Cited by 1,925
SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies
Bonneau, J., Miller, A., Clark, J., Narayanan, A., Kroll, J. A., & Felten, E. W. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.14 · Cited by 1,246
Bulletproofs: Short Proofs for Confidential Transactions and More
Bunz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., & Maxwell, G. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00020 · Cited by 1,154
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
Evaluating user privacy in bitcoin
Androulaki, E., Karame, G. O., Roeschlin, M., Scherer, T., & Capkun, S. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_4 · Cited by 700
Metadata
- Authors
- Camenisch, J., Hohenberger, S., & Lysyanskaya, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 302-321
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2137664544
- Cited by
- 431
- References
- 47
- FWCI
- 15.74
- 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.