CoChat

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

Bitansky, Nir, Canetti, Ran, Chiesa, Alessandro, Tromer, Eran · 2012 · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

The DOI matches its Crossref record; 77 of the 77 references it cites were found in a registry or an index.

Abstract

The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-sound proofs where the verifier's work is essentially independent of the complexity of the NP nondeterministic verifier) has been an intriguing question for the past two decades. Other than CS proofs in the random oracle model [Micali, FOCS '94], the only existing candidate construction is based on an elaborate assumption that is tailored to a specific protocol [Di Crescenzo and Lipmaa, CiE '08].

Overview

Integrity signals

Registry

Crossref · 10.1145/2090236.2090263

Cites

77 of 77 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Research works printed but not linked: 16

  1. 10.5555/1760749.1760759 · doi:10.5555/1760749.1760759
  2. 10.5555/646253.686344 · doi:10.5555/646253.686344
  3. 10.5555/1880918.1880936 · doi:10.5555/1880918.1880936
  4. 10.1137/070709244 · doi:10.1137/070709244 · Paper page
  5. 10.5555/2033036.2033046 · doi:10.5555/2033036.2033046
  6. 10.5555/1756123.1756163 · doi:10.5555/1756123.1756163
  7. 10.5555/1881412.1881446 · doi:10.5555/1881412.1881446
  8. 10.5555/646756.759582 · doi:10.5555/646756.759582
  9. 10.5555/3088723.3088762 · doi:10.5555/3088723.3088762
  10. 10.5555/1788414.1788417 · doi:10.5555/1788414.1788417
  11. 10.5555/1881412.1881445 · doi:10.5555/1881412.1881445
  12. 10.5555/1894302.1894327 · doi:10.5555/1894302.1894327
  13. 10.5555/646763.706338 · doi:10.5555/646763.706338
  14. 10.5555/646754.705190 · doi:10.5555/646754.705190
  15. 10.5555/1754542.1754568 · doi:10.5555/1754542.1754568
  16. 10.5555/1802614.1802616 · doi:10.5555/1802614.1802616

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

    “Succinct non-interactive zero-knowledge proofs (SNARKs) [65] are a type of ZKP that provides constant proof size and verification that depends only on the input size, linearly.”
    Background
  • 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

    “While knowledge-of-exponent assumptions are fairly strong, there is evidence that such assumptions may be inherent for constructing zk-SNARKs [24, 25].”
    BackgroundSelf-citation
  • On the Size of Pairing-Based Non-interactive Arguments

    Groth, J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_11 · Cited by 1,271

    “Gentry and Wichs [GW11] showed that SNARGs must necessarily rely on non-falsifiable assumptions, and Bitansky et al. [BCCT12] proved designated verifier SNARKs exist if and only if extractable collision-resistant hash functions exist.”
    Background
  • 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

    “Zero-knowledge SNARKs have been the subject of extensive research [Gro10,BCCT12,GGPR13, BCCT13,PHGR16,BSCG ` 13,Gro16].”
    Background
  • Security and Privacy on Blockchain

    Zhang, R., Xue, R., & Liu, L. (2020) · ACM Computing Surveys · doi:10.1145/3316481 · Cited by 959

    “Another variation is the zero-knowledge Succinct Non-interactive ARgument of Knowledge (zk-SNARK) proof, introduced in 2012 by Bitansky and his coauthors [16] and is served as the backbone of the Zcash protocol [82].”
    Background

See all 543

Metadata

Authors
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E.
Affiliations
  • Tel Aviv University (IL)
  • Boston University (US)
  • MIT Computer Science and Artificial Intelligence Laboratory (US)
Venue
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Publisher
ACM
Published
2012-01-08
Pages
326-349
OpenAlex
W2166670067
Cited by
493
References
77
Citations by year
2026: 29 · 2025: 48 · 2024: 60 · 2023: 48 · 2022: 42 · 2021: 36 · 2020: 30 · 2019: 34 · 2018: 21 · 2017: 23 · 2016: 25 · 2015: 18 · 2014: 31 · 2013: 34 · 2012: 13
FWCI
23.55
Type
conference paper
Language
en
Open access
closed
Locations
Conference on Innovations in Theoretical Computer Science (publishedVersion)
Funders
Seventh Framework Programme (240258)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
succinct non-interactive arguments of knowledge, computational soundness, random oracle model, brevity

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.