The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Zerocash: Decentralized Anonymous Payments from Bitcoin
Open accessAbstract
Bit coin is the first digital currency to see widespread adoption. While payments are conducted between pseudonyms, Bit coin cannot offer strong privacy guarantees: payment transactions are recorded in a public decentralized ledger, from which much information can be deduced. Zero coin (Miers et al., IEEE S&P 2013) tackles some of these privacy issues by unlinking transactions from the payment's origin. Yet, it still reveals payments' destinations and amounts, and is limited in functionality. In this paper, we construct a full-fledged ledger-based digital currency with strong privacy guarantees. Our results leverage recent advances in zero-knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs). First, we formulate and construct decentralized anonymous payment schemes (DAP schemes). A DAP scheme enables users to directly pay each other privately: the corresponding transaction hides the payment's origin, destination, and transferred amount. We provide formal definitions and proofs of the construction's security. Second, we build Zero cash, a practical instantiation of our DAP scheme construction. In Zero cash, transactions are less than 1 kB and take under 6 ms to verify - orders of magnitude more efficient than the less-anonymous Zero coin and competitive with plain Bit coin.
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
Bitcoin: A Peer-to-Peer Electronic Cash System
Wright, C. S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3440802 · Cited by 13,922
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
Introduction to Modern Cryptography
Katz, J., & Lindell, Y. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b17668 · Cited by 1,880
Introduction to Modern Cryptography
Katz, J., & Lindell, Y. (2007) · doi:10.1201/9781420010756 · Cited by 1,238
Information propagation in the Bitcoin network
Decker, C., & Wattenhofer, R. (2013) · IEEE P2P 2013 Proceedings · doi:10.1109/p2p.2013.6688704 · Cited by 1,192
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
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
Self-citationPinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
Quadratic Span Programs and Succinct NIZKs without PCPs
Gennaro, R., Gentry, C., Parno, B., & Raykova, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_37 · Cited by 724
Research works printed but not linked: 7
- ben-sasson, 2013, Universal and Affordable Computational Integrity
- lee, 2013, Bitcoin Needs to Scale by A Factor of 1000 to Compete with Visa Here's How to Do It
- ben-sasson, 0, Succinct Noninteractive Arguments for A von Neumann Architecture
- wuille, 2014, Proposed BIP for Dealing with Malleability
- maxwell, 2013, Coin Join Bitcoin Privacy for the Real World
- dingledine, 0, Tor: The secondgeneration onion router, Security '04
- 2000, SEC 1 Elliptic curve cryptography
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“Most existing SNARK constructions leverage quadratic arithmetic programs [174, 317, 118] and are now available in open-source libraries, such as libsnark [5], and deployed in cryptocurrencies, such as Zcash [57].”
MethodAn 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
Hyperledger fabric: a distributed operating system for permissioned blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · Proceedings of the Thirteenth EuroSys Conference · doi:10.1145/3190508.3190538 · Cited by 3,654
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
Metadata
- Authors
- Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M.
- Venue
- 2014 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2014-05
- Pages
- 459-474
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2043007983
- Cited by
- 1,925
- References
- 33
- FWCI
- 34.59
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Zerocash: Decentralized Anonymous Payments from Bitcoin. https://app.cochat.ai/papers/10.1109/sp.2014.36
- The paper
- Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014). Zerocash: Decentralized Anonymous Payments from Bitcoin. 2014 IEEE Symposium on Security and Privacy. https://doi.org/10.1109/sp.2014.36
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.
