The DOI matches its Crossref record; 33 of the 36 references it cites were found in a registry or an index.
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Open accessAbstract
Bitcoin is the first e-cash system to see widespread adoption. While Bitcoin offers the potential for new types of financial interaction, it has significant limitations regarding privacy. Specifically, because the Bitcoin transaction log is completely public, users' privacy is protected only through the use of pseudonyms. In this paper we propose Zerocoin, a cryptographic extension to Bitcoin that augments the protocol to allow for fully anonymous currency transactions. Our system uses standard cryptographic assumptions and does not introduce new trusted parties or otherwise change the security model of Bitcoin. We detail Zerocoin's cryptographic construction, its integration into Bitcoin, and examine its performance both in terms of computation and impact on the Bitcoin protocol.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Mixing protocols such as CoinJoin [70], Ring Signature blockchains like Monero [72] and Zero-Knowledge blockchains like Zerocoin [16], all hinder the token's history, making the owner's addresses uncorrelatable by hiding them in a set of possible owners.”
From Privacy-Preserving Solutions for Blockchain: Review and Challenges (2019) · cites this paper as [16]
In the citing paper
“Implementations such as IBM's Identity Mixer [21], [22] or Microsoft's U-Prove [23] have not had the expected adoption rate.”
From A Trusted Approach for Decentralised and Privacy-Preserving Identity Management (2021) · cites this paper as [21]
Citations
Cites
Bitcoin: A Peer-to-Peer Electronic Cash SystemPreprint
Nakamoto, S. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3440802 · Cited by 14,677
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_12 · Cited by 3,972
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,329
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,782
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
De-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2009.22 · Cited by 1,324
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
Efficient group signature schemes for large groups
Camenisch, J. L., & Stadler, M. A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052252 · Cited by 1,153
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_19 · Cited by 1,148
Chaum, D., Fiat, A., & Naor, M. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_25 · Cited by 1,138
Quantitative Analysis of the Full Bitcoin Transaction Graph
Ron, D., & Shamir, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_2 · Cited by 1,019
Bäckström, L., Dwork, C., & Kleinberg, J. M. (2007) · International World Wide Web Conference (WWW) · doi:10.1145/1242572.1242598 · Cited by 869
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Camenisch, J. L., & Lysyanskaya, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_5 · Cited by 731
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 672
Self-citationBitter to Better - How to Make Bitcoin a Better Currency
Barber, S., Boyen, X., Shi, E., & Uzun, E. (2012) · Financial Cryptography · doi:10.1007/978-3-642-32946-3_29 · Cited by 627
An Analysis of Anonymity in the Bitcoin System
Reid, F., & Harrigan, M. (2011) · International Conference on Social Computing · doi:10.1109/passat/socialcom.2011.79 · Cited by 598
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
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
Accumulators from Bilinear Pairings and Applications
Nguyen, L. D. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_19 · Cited by 447
Camenisch, J. L., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture notes in computer science · doi:10.1007/11426639_18 · Cited by 431
Okamoto, T., & Ohta, K. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_27 · Cited by 310
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Camenisch, J. L., & Michels, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_8 · Cited by 300
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Camenisch, J. L., Kohlweiss, M., & Soriente, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00468-1_27 · Cited by 298
Chase, M., & Lysyanskaya, A. (2006) · Lecture notes in computer science · doi:10.1007/11818175_5 · Cited by 264
Provably secure blind signature schemes
Pointcheval, D., & Stern, J. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034852 · Cited by 249
An Efficient Divisible Electronic Cash Scheme
Okamoto, T. (1995) · Lecture notes in computer science · doi:10.1007/3-540-44750-4_35 · Cited by 188
Group 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 173
Two Bitcoins at the Price of One? Double-Spending Attacks on Fast Payments in Bitcoin.
Karame, G., Androulaki, E., & Čapkun, S. (2012) · Cited by 168
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
Mercurial Commitments with Applications to Zero-Knowledge Sets
Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., & Reyzin, L. (2005) · Lecture notes in computer science · doi:10.1007/11426639_25 · Cited by 68
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
Efficient Accumulators without Trapdoor Extended Abstract
Sander, T. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-47942-0_21 · Cited by 51
Mercurial Commitments with Applications to Zero-Knowledge Sets
Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., & Reyzin, L. (2012) · Journal of Cryptology · doi:10.1007/s00145-012-9122-9 · Cited by 45
Flagged first, then by citations
3 of the 36 references couldn’t be matched to a known paper.
Research works printed but not linked: 8
- sander, 1999, Auditable, anonymous electronic cash (extended abstract), LNCS, 1666, 555
- 2012, Virtual Currency Schemes
- dai, 0, B-money Proposal [Online]
- camenisch, 0, Dynamic accumulators and application to efficient revocation of anonymous credentials, CRYPTO '02 2002 Extended Abstract [Online] Available
- 0, The Bitcoin Laundry
- 0, Bitcoin Fog Company
- lee, 2011, A Risky Currency? Alleged $500 000 Bitcoin Heist Raises Questions
- 0, Blind Bitcoin
Cited by
Sorted by citations
An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends
Zheng, Z., Xie, S., Dai, H., Chen, X., & Wang, H. (2017) · 2017 IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdatacongress.2017.85 · Cited by 4,515
Blockchain challenges and opportunities: a survey
Zheng, Z., Xie, S., Dai, H. N., Chen, X., & Wang, H. (2018) · International Journal of Web and Grid Services · doi:10.1504/ijwgs.2018.095647 · Cited by 3,651
Casino, F., Dasaklis, T. K., & Patsakis, C. (2018) · Telematics and Informatics · doi:10.1016/j.tele.2018.11.006 · Cited by 2,954
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
Zerocash: Decentralized Anonymous Payments from Bitcoin
Ben‐Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.36 · Cited by 1,987
Self-citation
Metadata
- Authors
- Miers, I., Garman, C., Green, M., & Rubin, A. D.
- Affiliations
- Johns Hopkins University (US)
- Venue
- 2013 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 397-411
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2013686672
- Cited by
- 983
- References
- 36
- Citations by year
- 2026: 27 · 2025: 61 · 2024: 71 · 2023: 63 · 2022: 88 · 2021: 114 · 2020: 124 · 2019: 107 · 2018: 91 · 2017: 64 · 2016: 57 · 2015: 55 · 2014: 43 · 2013: 17
- FWCI
- 37.03
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- IEEE Symposium on Security and Privacy (S&P) (publishedVersion)
- Funders
- Defense Advanced Research Projects Agency (FA8750, FA8750-11-2-0211)
- Office of Naval Research (N00014)
- Air Force Research Laboratory (FA8750-11-2- 0211.)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Keywords
- Bitcoin, e-cash, anonymity, privacy, cryptocurrency, cryptographic constructions, pseudonyms, transaction logs
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
