The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Zether: Towards Privacy in a Smart Contract World
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
Cites
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
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
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 · cited 1×
“Bulletproofs [61] enable proofs on Pedersen committed values by computing a linear combination of commitments and opening that combination.”
BackgroundSelf-citationZerocoin: 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
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Succinct non-interactive zero-knowledge for a von Neumann architecture
Ben‐Sasson, E., Chiesa, A., Tromer, E., & Virza, M. (2014) · Cited by 772
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Camenisch, J., & Lysyanskaya, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_5 · Cited by 732
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
Mixcoin: Anonymity for Bitcoin with Accountable Mixes
Bonneau, J., Narayanan, A., Miller, A., Clark, J., Kroll, J. A., & Felten, E. W. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45472-5_31 · Cited by 441
Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts
Cheng, R., Zhang, F., Kos, J., He, W., Hynes, N., Johnson, N., Juels, A., Miller, A., & Song, D. (2019) · 2019 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2019.00023 · Cited by 431
Casper the Friendly Finality Gadget
Schwarz-Schilling, C., Saleh, F., Thiery, T., Pan, J., Shah, N., & Monnot, B. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.aft.2023.30 · Cited by 405
CoinShuffle: Practical Decentralized Coin Mixing for Bitcoin
Ruffing, T., Moreno-Sanchez, P., & Kate, A. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11212-1_20 · Cited by 401
A Secure and Optimally Efficient Multi-Authority Election Scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_9 · Cited by 357
Centrally Banked Cryptocurrencies
Danezis, G., & Meiklejohn, S. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23187 · Cited by 300
TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment Hub
Heilman, E., AlShenibr, L., Baldimtsi, F., Scafuro, A., & Goldberg, S. (2017) · Proceedings 2017 Network and Distributed System Security Symposium · doi:10.14722/ndss.2017.23086 · Cited by 270
On Bitcoin as a public randomness source.Preprint
Bonneau, J., Clark, J., & Goldfeder, S. (2015) · IACR Cryptology ePrint Archive · Cited by 204
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
Groth, J., & Kohlweiss, M. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_9 · Cited by 198
Zerocash: Decentralized Anonymous Payments from Bitcoin.Preprint
Ben‐Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · IACR Cryptology ePrint Archive · Cited by 195
Abdalla, M., An, J. H., Bellare, M., & Namprempre, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_28 · Cited by 189
ZEXE: Enabling Decentralized Private Computation
Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., & Wu, H. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00050 · Cited by 184
(2015) · IACR Cryptology ePrint Archive · Cited by 160
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
Cramer, R., & Damgård, I. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055745 · Cited by 159
On the Evaluation of Powers and Monomials
Pippenger, N. J. (1980) · SIAM Journal on Computing · doi:10.1137/0209022 · Cited by 151
Short Accountable Ring Signatures Based on DDH
Bootle, J., Cerulli, A., Chaidos, P., Ghadafi, E., Groth, J., & Petit, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24174-6_13 · Cited by 127
Solidus: Confidential Distributed Ledger Transactions via PVORM
Cecchetti, E., Zhang, F., Ji, Y., Kosba, A. E., Juels, A., & Shi, E. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3134010 · Cited by 112
Möbius: Trustless Tumbling for Transaction Privacy
Meiklejohn, S., & Mercer, R. (2018) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2018-0015 · Cited by 103
Galbraith⋆, S. D., & Moriai, S. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5 · Cited by 32
Cited by
The Roadmap to 6G Security and Privacy
Porambage, P., Gur, G., Osorio, D. P. M., Liyanage, M., Gurtov, A., & Ylianttila, M. (2021) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2021.3078081 · Cited by 416
Security Challenges and Opportunities for Smart Contracts in Internet of Things: A Survey
Peng, K., Li, M., Huang, H., Wang, C., Wan, S., & Choo, K.-K. R. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3074544 · Cited by 130
SoK: SGX.Fail: How Stuff Gets eXposed
Van Schaik, S., Seto, A., Yurek, T., Batori, A., AlBassam, B., Genkin, D., Miller, A., Ronen, E., Yarom, Y., & Garman, C. (2024) · 2024 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp54263.2024.00260 · Cited by 31
Metadata
- Authors
- Bünz, B., Agrawal, S., Zamani, M., & Boneh, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2020
- Pages
- 423-443
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W3043762149
- Cited by
- 314
- References
- 28
- FWCI
- 39.09
- 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.