From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
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
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
“Other platforms include [125] focused on a range of medical applications and [321] for enterprise use cases.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [321]
In the citing paper
“- IBM Federated Learning [321] is a Python-based federated learning framework for enterprise environments, which provides a basic fabric for adding advanced features.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [321]
In the citing paper
“- IBM Federated Learning [321] is a Python-based federated learning framework for enterprise environments, which provides a basic fabric for adding advanced features.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [321]
Citations
Cites
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Self-citationThe knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Research works printed but not linked: 16
- 10.5555/1760749.1760759 · doi:10.5555/1760749.1760759
- 10.5555/646253.686344 · doi:10.5555/646253.686344
- 10.5555/1880918.1880936 · doi:10.5555/1880918.1880936
- 10.1137/070709244 · doi:10.1137/070709244 · Paper page
- 10.5555/2033036.2033046 · doi:10.5555/2033036.2033046
- 10.5555/1756123.1756163 · doi:10.5555/1756123.1756163
- 10.5555/1881412.1881446 · doi:10.5555/1881412.1881446
- 10.5555/646756.759582 · doi:10.5555/646756.759582
- 10.5555/3088723.3088762 · doi:10.5555/3088723.3088762
- 10.5555/1788414.1788417 · doi:10.5555/1788414.1788417
- 10.5555/1881412.1881445 · doi:10.5555/1881412.1881445
- 10.5555/1894302.1894327 · doi:10.5555/1894302.1894327
- 10.5555/646763.706338 · doi:10.5555/646763.706338
- 10.5555/646754.705190 · doi:10.5555/646754.705190
- 10.5555/1754542.1754568 · doi:10.5555/1754542.1754568
- 10.5555/1802614.1802616 · doi:10.5555/1802614.1802616
Cited by
Items 301–400 of 544
VOProof: Efficient zkSNARKs from Vector Oracle Compilers
Zhang, Y., Szepeniec, A., Zhang, R., Sun, S.-F., Wang, G., & Gu, D. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3559387 · Cited by 6
“in 2012 [8], allow a prover to generate a short proof π for a computation output y = F (x,w) of an arbitrary function F and public input x , such that a resource-constrained verifier can validatey with at mostO (polylog( |F |)) computation and storage costs while learning nothing about the secret inputw .”
BackgroundXiong, T., Zhang, Z., & Jing, C. (2024) · Communications in computer and information science · doi:10.1007/978-981-97-0730-0_22 · Cited by 6
BcWAN: A Federated Low-Power WAN for the Internet of Things (Industry track)
Bezahaf, M., Cathelain, G., & Ducrocq, T. (2018) · doi:10.1145/3284028.3284036 · Cited by 6
“comparably with an embedded architecture) both memory and computational heavy [22], which is why we moved away from this approach.”
BackgroundSecure Cyber-Physical Object Identification in Industrial IoT-Systems
Wöhnert, K. H., Wöhnert, S.-J., Thiel, T., Weißbach, R., & Skwarek, V. (2020) · Procedia Manufacturing · doi:10.1016/j.promfg.2020.10.171 · Cited by 6
Pretzel: Email encryption and provider-supplied functions are compatiblePreprint
Gupta, T., Fingler, H., Alvisi, L., & Walfish, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.04265 · Cited by 7
“this assumption by choosing model elements that are larger than b in bits. Pretzel’s response is to draw on probabilistic proofs, specifically succinct zero knowledge proofs, sometimes known as SNARKs [30, 54]. Using this primitive, a party can, remarkably, convince others that it knows the satisfying assignment to a p…”
BackgroundLinear-time and post-quantum zero-knowledge SNARKs for R1CSPreprint
Lee, J. L. C., Setty, S., Thaler, J., & Wahby, R. S. (2021) · IACR Cryptology ePrint Archive · Cited by 6
Hybrid Publicly Verifiable Computation
Alderman, J., Janson, C., Cid, C., & Crampton, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29485-8_9 · Cited by 5
“Most work requires the client to know the data in order to verify [18, 9, 11, 22].”
BackgroundSefranek, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-71070-4_5 · Cited by 5
“The most widely used type of zero-knowledge proof systems are zk-SNARKs ( s uccinct n on-interactive ar guments of k nowledge ) [BCCT12].”
MethodAttribute-based multi-function verifiable computation
Wu, Y. N., Liu, M., Xue, R., & Zhang, R. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.02.030 · Cited by 5
Osmanoğlu, M., & Selçuk, A. A. (2022) · TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES · doi:10.3906/elk-2105-183 · Cited by 5
HCPP: A Data-Oriented Framework to Preserve Privacy during Interactions with Healthcare Chatbot
Cai, Z., Chang, X., & Ping, L. (2023) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/ipccc59175.2023.10253855 · Cited by 8
PAFL: Parameter-Authentication Federated Learning for Internet of Vehicles
Li, Z., Wu, H., Dai, Y., & Lu, Y. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437116 · Cited by 5
“Specifically, we use zkSNARK [14], a start-of-the-art zero knowledge proof technique, to authenticate models. zkSNARK allows the prover to prove his/her knowledge in a single message, which accords with the high mobility and strict delay requirement of the IoV.”
MethodSoK: Privacy-Enhancing Technologies in Finance
Baum, C., Chiang, J. H.-Y., David, B., & Frederiksen, T. K. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.aft.2023.12 · Cited by 8
“Some ZK on the other hand (in particular SNARKs [17]) has the powerful feature that it can reduce the communication and computation overhead over native computation (for some of the involved parties only!).”
BackgroundHow To Construct Extractable One-Way Functions Against Uniform Adversaries.
Bitansky, N., Canetti, R., & Paneth, O. (2013) · Cited by 5
Self-citationGeneric hardness of inversion on ring and its relation to self-bilinear map
Yamakawa, T., Yamada, S., Hanaoka, G., & Kunihiro, N. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.03.009 · Cited by 5
Xu, S., Cai, X., Zhao, Y., Ren, Z., Wu, L., Zhang, H., Du, L., & Tong, Y. (2020) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom50675.2020.00092 · Cited by 5
On a Partially Verifiable Multi-party Multi-argument Zero-knowledge Proof
Ryu, H., Kang, D., & Won, D. (2021) · International Conference on Ubiquitous Information Management and Communication (IMCOM) · doi:10.1109/imcom51814.2021.9377407 · Cited by 5
Forward-Secure Multi-User Aggregate Signatures Based on zk-SNARKs
Lee, J., Kim, J., & Oh, H. (2021) · IEEE Access · doi:10.1109/access.2021.3093925 · Cited by 5
“We use a hash extractability assumption [46] stated as below.”
MethodA zero-knowledge proof system for OpenLibra
Biel, P., Zhang, S., & Jacobsen, H. (2021) · International Middleware Conference · doi:10.1145/3491086.3492469 · Cited by 5
“An alternative to ZK-STARK is ZK-SNARK ( Zero-Knowledge Suc-cinct Non-interactive ARgument of Knowledge ), a non-interactive ZKP protocol initially proposed by Bitansky et al. [3] in 2011.”
MethodA Secure Consensus Protocol for SidechainsPreprint
Gai, F., Grajales, C., Niu, J., Jalalzai, M. M., & Feng, C. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.06490 · Cited by 5
“NOCUST also utilizes zkSNARK [6] in its smart contract which enables efficient verification of the complete correctness of checkpoints.”
MethodEfficient RAM and control flow in verifiable outsourced computation.Preprint
Wahby, R. S., Setty, S., Ren, Z., Blumberg, A. J., & Walfish, M. (2014) · IACR Cryptology ePrint Archive · Cited by 5
Self-Sovereign Identity: A Systematic Map and Review.Preprint
Schardong, F., & Custódio, R. F. (2021) · arXiv (Cornell University) · Cited by 6
Overcoming the Worst-Case Curse for Cryptographic Constructions.Preprint
Goldwasser, S., Kalai, Y. T., Popa, R. A., Vaikuntanathan, V., & Zeldovich, N. (2013) · IACR Cryptology ePrint Archive · Cited by 9
Single-Round Proofs of Quantumness from Knowledge Assumptions
Arabadjieva, P., Gheorghiu, A., Gitton, V., & Metger, T. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2025.8 · Cited by 5
High-Performance Number Theoretic Transform on GPU Through radix2-CT and 4-Step Algorithms
Özcan, A. Ş., Javeed, A., & Savaş, E. (2025) · IEEE Access · doi:10.1109/access.2025.3570024 · Cited by 4
“…community has invested significant time and The associate editor coordinating the review of this manuscript and approving it for publication was Mehdi Sookhak . enormous efforts to theorize and build practical solutions of real-world significance in this arena [10], [11], [12], [13], [14], [15].”
An Extended Survey Concerning the Vector Commitments
Nuțu, M., Akhalaia, G., Bocu, R., & Iavich, M. (2025) · Applied Sciences · doi:10.3390/app15179510 · Cited by 4
Pipelonk: Accelerating End-to-End Zero-Knowledge Proof Generation on GPUs for PLONK-Based Protocols
Zhang, Z., Cai, Y., Yin, W., Wu, X., Wang, Y., Ju, L., & Ji, Z. (2026) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/3774934.3786448 · Cited by 4
“Among various ZKP protocols, zkSNARKs [7, 25, 26, 29] represent a prominent category due to their succinctness.”
Faonio, A., & Nielsen, J. B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54365-8_14 · Cited by 5
Unleashing the Future of Healthcare in the Metaverse: The Pivotal Role of Blockchain in Data Privacy
George, L., & Kizhakkethottam, J. J. (2024) · Advances in medical technologies and clinical practice book series · doi:10.4018/979-8-3693-1515-6.ch004 · Cited by 4
MoltDB: Accelerating Blockchain via Ancient State Segregation
Liang, J., Chen, W., Hong, Z., Zhu, H., Qiu, W., & Zheng, Z. (2024) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2024.3467927 · Cited by 4
“As an alternative to the Merkle tree, Aardvark [19] designs an authenticated dictionary with short SNARK proofs [46] of correctness for lookups and modifications.”
MethodBatching Adaptively-Sound SNARGs for NP
Devadas, L., Waters, B. R., & Wu, D. J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-78017-2_12 · Cited by 4
Transparent SNARKs over Galois Rings
Wei, Y., Zhang, X., & Deng, Y. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91820-9_14 · Cited by 4
Outsourcing Computation: The Minimal Refereed Mechanism
Kong, Y., Peikert, C., Schoenebeck, G. R., & Tao, B. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-35389-6_19 · Cited by 6
“Interactive Proof (IP) literature Since the seminal work of Goldwasser et al. [18] and Babai and Moran [3] introducing interactive proofs (IP), a host of results in closely related models have followed (see, e.g., [7, 19, 20, 4]).”
Multikey Verifiable Homomorphic Encryption
Lu, Y., Hara, K., & Tanaka, K. (2022) · IEEE Access · doi:10.1109/access.2022.3197634 · Cited by 4
“Lai et al. [22] introduced a new security notion called unforgeability under insider corruptions for MHS and showed that an MHS scheme satisfying such a strong security notion can be constructed from zero-knowledge succinct non-interactive arguments of knowledge (ZK-SNARK) [2], [12].”
BackgroundShorter ZK-SNARKs from square span programs over ideal lattices
Lin, X., Cao, H., Liu, F.-H., Wang, Z., & Wang, M. (2024) · Cybersecurity · doi:10.1186/s42400-024-00215-x · Cited by 6
“The concept of SNARK has been extensively investigated in the literature (Bitansky et al. 2011, 2012, 2017; Goldwasser et al. 2011), and subsequent works mainly focus on enhancing the efficiency for practical use.”
BackgroundTemporary relay: A more flexible way to cross chains
Wang, H., Wang, J., Liu, L., & Lu, Y. (2024) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-024-01762-3 · Cited by 4
“In 2011, Nir Bitansky et al. proposed zk-SNARK [24], highlighting the importance of non-interactivity, short proof length, and fast verification time for practical zero-knowledge proof systems. zk-SNARK, known for its low overhead and high efficiency, became the most widely used zero-knowledge…”
Verifiable state machines: Proofs that untrusted services operate correctly
Setty, S., Angel, S., & Lee, J. (2020) · ACM SIGOPS Operating Systems Review · doi:10.1145/3421473.3421479 · Cited by 5
“Instead, Spice employs an argument protocol, referred to as a zero-knowledge succinct non-interactive argument of knowledge (zkSNARK) [9, 19], to encode the prover’s solution as a small proof π.”
BackgroundBlockchain-Based Fair and Secure Certified Electronic Mail Without a TTP
Elmaghraby, K., & Dimitriou, T. D. (2021) · IEEE Access · doi:10.1109/access.2021.3096661 · Cited by 4
“The properties expected by zkSNARKS are completeness, soundness and zero-knowledge [44].”
BackgroundZXAD: High-volume Attack Mitigation for Tor
Mani, A., & Goldberg, I. (2021) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/3463676.3485609 · Cited by 4
“Therefore, we use a zkSNARK [6] instead.”
BackgroundSuccinct Publicly-Certifiable Proofs: Or, Can a Blockchain Verify a Designated-Verifier Proof?
Campanelli, M., & Khoshakhlagh, H. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92518-5_27 · Cited by 4
“The work in [5] also discusses how to compose (unleveled) FHE and “proofs” of the verification algorithms to obtain succinct arguments of knowledge (in their Section 9).”
BackgroundVisual Blockchain for Intelligent Surveillance in a Smart City
Gedara, K. M., Nguyen, M., & Yan, W. Q. (2022) · Practice, progress, and proficiency in sustainability · doi:10.4018/978-1-7998-9274-8.ch012 · Cited by 5
Privacy-preserving cryptographic algorithms and protocols: a survey on designs and applications
Wei, H. U. O., Yu, Y., Yang, K., Zheng, Z., Li, X., Li, Y., & Xie, J. (2023) · Scientia Sinica Informationis · doi:10.1360/ssi-2022-0434 · Cited by 4
From Interaction to Independence: zkSNARKs for Transparent and Non-Interactive Remote Attestation
Ebrahimi, S., & Hassanizadeh, P. (2024) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2024.24815 · Cited by 11
“SNARKs are cryptographic protocols used to efficiently prove the correctness of a computation in a non-interactive manner, providing succinct proofs [24].”
MethodExtended Functionality in Verifiable Searchable Encryption
Alderman, J., Janson, C., Martin, K. M., & Renwick, S. L. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29172-7_12 · Cited by 4
Constant-Round Concurrent Zero-Knowledge From Falsifiable AssumptionsPreprint
Chung, K.-M., Lin, H., & Pass, R. (2012) · IACR Cryptology ePrint Archive · Cited by 4
Outsourcing Private Machine Learning via Lightweight Secure Arithmetic ComputationPreprint
Garg, S., Ghodsi, Z., Hazay, C., Ishai, Y., Marcedone, A., & Venkitasubramaniam, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.01372 · Cited by 4
“A generic approach to achieve our goal would be for the servers to rely on a secure arithemtic computation protocol to compute the result and a zkSNARK proof of correctness of the computation [BCCT12].”
MethodBPA: A decentralized payment system that balances privacy and auditability
Gao, L., Zhang, J., Yu, J., Tang, Y., & Zeng, Z. (2024) · AIMS Mathematics · doi:10.3934/math.2024302 · Cited by 3
A Critical View on Blockchain Rollups
Katsika, A., Negka, L., Spathoulas, G. P., & Plagianakos, V. P. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-66708-4_10 · Cited by 6
ZkVML: Zero-Knowledge Verifiable Machine Learning
Aziz, M. B., Naushad, A. S., Siddiqui, M. U., & Shamsi, J. A. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-89813-6_14 · Cited by 8
A Crack in the Firmament: Restoring Soundness of the Orion Proof System and More
den Hollander, T., & Slamanig, D. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5116-3_13 · Cited by 3
“The arguably most quickly developing domain related to zero-knowledge is that of zk-SNARKs (succinct non-interactive arguments of knowledge) [5].”
BackgroundLattice-Based Multi-message Multi-recipient KEM/PKE with Malicious Security
Liu, Z., Sotiraki, K., Tromer, E., & Wang, Y. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5099-9_14 · Cited by 4
“In this section, we briefly recall the definition of zero-knowledge succinct non-interactive argument of knowledge (zk-SNARK) introduced in [11].”
Self-citationeSTARK: extending STARKs with arguments
Ardévol, H. M., Baylina, J., Guzmán-Albiol, M., & Muñoz, J. L. (2024) · Designs Codes and Cryptography · doi:10.1007/s10623-024-01457-z · Cited by 3
“One family of ZKPs that has become of important consideration in recent years both in theory and in practice are zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) [9].”
“Check-Before-you-Solve”: Verifiable Time-Lock Puzzles
Xin, J., & Papadopoulos, D. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00053 · Cited by 3
“If a SNARK is also zero-knowledge, a simulator exists to generate proofs without knowing the witness [23], [56].”
On the Connection between Leakage Tolerance and Adaptive Security.Preprint
Nielsen, J. B., Venturi, D., & Zottarel, A. (2014) · IACR Cryptology ePrint Archive · Cited by 4
Datta, P., Dutta, R., & Mukhopadhyay, S. (2019) · Algorithmica · doi:10.1007/s00453-019-00576-7 · Cited by 3
“3248 Algorithmica (2019) 81:3245–3390 However, both the aforementioned CPRF constructions rely on the existence of public-coin differing-input obfuscators [47] and succinct non-interactive arguments of knowledge [11,38], which are believed to be risky assumptions due to their inherent extractability nature.”
BackgroundAuthCropper: Authenticated Image Cropper for Privacy Preserving Surveillance Systems
Kim, J., Lee, J., Ko, H., Oh, D., Han, S., Jeong, G., & Oh, H. (2019) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3358195 · Cited by 3
“Photoproof [16] implements SNARK [4] proof to digital images.”
InfluentialTrojan-Resilience Without Cryptography
Chakraborty, S., Dziembowski, S., Gałązka, M., Lizurej, T., Pietrzak, K., & Yeo, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-90453-1_14 · Cited by 3
“Here the idea is to let F (cid:5) ( x ) output a tuple ( y, π ) where y = F ( x ) and π is a succinct zero-knowledge proof (see [3]) that y is the correct output.”
BackgroundRegulation-Friendly Privacy-Preserving Blockchain Based on zk-SNARK
Xu, L., Zhang, Y., & Zhu, L. (2023) · Lecture notes in business information processing · doi:10.1007/978-3-031-34985-0_17 · Cited by 4
Towards a Privacy-Preserving Attestation for Virtualized Networks
Arfaoui, G., Jacques, T., Lacoste, M., Onete, C., & Robert, L. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-51482-1_18 · Cited by 3
“Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge (ZK-SNARKs) [5] are generic NIZK proof systems.”
BackgroundDelegable zk-SNARKs with proxies
Sha, J., & Liu, S. (2023) · Frontiers of Computer Science · doi:10.1007/s11704-023-2782-9 · Cited by 3
Circuit-Succinct Universally-Composable NIZKs with Updatable CRS
Abdolmaleki, B., Glaeser, N., Ramacher, S., & Slamanig, D. (2024) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf61375.2024.00006 · Cited by 3
“These so-called zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) [18] have also enabled proofs of statements that are not efficiently realizable with NIZKs for algebraic languages.”
BackgroundBuilding Trustworthy AI Systems: AI Inference Verification with Blockchain and Zero-Knowledge Proofs
Germani, P., Manzari, M. A., Magni, R., Dibitonto, P., Previtali, F., & D’Agostini, E. (2024) · Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS) · doi:10.1109/brains63024.2024.10732140 · Cited by 3
NOPE: Strengthening domain authentication with succinct proofs
DeStefano, Z., Jeff, J., Bonneau, J., & Walfish, M. (2024) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3694715.3695962 · Cited by 4
“A succinct proof that is non-interactive and zero-knowledge is now known as a zkSNARK [21, 55] (in the lineage of non-interactive and zero-knowledge proofs, known as NIZKs [22, 50]).”
Addressing Scalability Issues of Blockchains With Hypergraph Payment Networks
Kotzer, A., Ladóczki, B., Tapolcai, J., & Rottenstreich, O. (2025) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2025.3542960 · Cited by 5
“While zk-SNARK (zero-knowledge Succinct Non-interactive Argument of Knowledge) [20], [21], [22] based zk-rollups are computationally demanding, as they publish a validity proof along with the state change optimistic rollups skip this step and the state is assumed to be valid by default and for a…”
The Feasibility of Outsourced Database Search in the Plain Model
Hazay, C., & Zarosim, H. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-44618-9_17 · Cited by 3
Outsourcing Medical Dataset Analysis: A Possible Solution
Kaptchuk, G., Green, M., & Rubin, A. D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70972-7_6 · Cited by 3
Bounded Fully Homomorphic Signature Schemes.Preprint
Xie, X., & Xue, R. (2014) · IACR Cryptology ePrint Archive · Cited by 4
Zhang, Y., Papamanthou, C., & Katz, J. I. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3233181 · Cited by 3
“Better VC protocols for graph algorithms can be derived in principle using general-purpose VC schemes [9, 10, 12, 17, 25, 26, 34] or one of the systems that have been built to apply these techniques [6–8, 14, 19, 38–40, 43, 44, 46].”
Methodemmy – Trust-Enhancing Authentication Library
Stopar, M., Bizjak, M., Modic, J., Hartman, J., Žitnik, A., & Marc, T. (2019) · IFIP advances in information and communication technology · doi:10.1007/978-3-030-33716-2_11 · Cited by 3
“In 2012, a novel form of ZKPs was proposed [1], named Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK).”
BackgroundThe Decentralized Rights Locker
Thorwirth, N. (2020) · SMPTE Motion Imaging Journal · doi:10.5594/jmi.2019.2957687 · Cited by 3
Multi-matrix verifiable computation
He, Y., & Zhang, L. F. (2020) · Cluster Computing · doi:10.1007/s10586-020-03116-z · Cited by 3
“Numerous solutions [27,29,11] have been proposed and optimized for many different scenarios.”
Using blockchain technology for software identity maintenance
Drăgnoiu, A.-E. (2021) · International Middleware Conference Doctoral Symposium · doi:10.1145/3491087.3493682 · Cited by 3
“Although using privacy-preserving technologies together with blockchain technology seems promising, they are not yet ready to be used in production: improvements in the efficiency of SNARKs and STARKs are topics that further need research [21].”
BackgroundMethodNearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.Preprint
Bootle, J., Cerulli, A., Groth, J., Jakobsen, S., & Maller, M. (2018) · IACR Cryptology ePrint Archive · Cited by 3
On Constant-Round Concurrent Zero-Knowledge from a Knowledge AssumptionPreprint
Gupta, D., & Sahai, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.3719 · Cited by 3
Ateniese, G., Dagdelen, Ö., Damgård, I., & Venturi, D. (2012) · Cited by 7
Requirement Analyses and Evaluations of Blockchain Platforms per Possible Use CasesPreprint
Saito, K., Shiseki, A., Takada, M., Yamamoto, H., Saitoh, M., Ohkawa, H., Andou, H., Miyamoto, N., Yamakawa, K., Kurakawa, K., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.03209 · Cited by 3
Decentralized Blockchain interoperability
Zindros, D. (2020) · doi:10.12681/eadd/49388 · Cited by 3
zkStream: a Framework for Trustworthy Stream Processing
Swalens, J., Hoste, L., Beni, E. H., & Trappeniers, L. (2024) · International Middleware Conference · doi:10.1145/3652892.3700763 · Cited by 2
Yang, J., Wu, H., Chen, X., Cao, Z., & Dong, X. (2024) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/secon64284.2024.10934907 · Cited by 2
“Zero-Knowledge Succinct Non-interactive Argument of Knowledge (zk-SNARKs) [17] is a ZKP variant, designed to enhance the efficiency and succinctness of the proof process while maintaining zero-knowledge. zk-SNARKs consists of the following three algorithms:”
Securing Offline CBDC Transactions: DigiVault Card and MarkoPayChain with Mobile Phone Integration
Atangana, O., Khoukhi, L., Barbier, M., & Manno, J. D. (2025) · Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN) · doi:10.1109/icin64016.2025.10942801 · Cited by 2
An anonymous blockchain transaction scheme based on SM9
Dong, J., Li, C., Shen, Z., Hu, D., Shen, Q., Fang, Y., & Wu, Z. (2025) · Scientia Sinica Informationis · doi:10.1360/ssi-2025-0013 · Cited by 4
Fast Elliptic Curve Scalar Multiplications in SN(T)ARK Circuits
Eagen, L., Housni, Y. E., Masson, S., & Piellard, T. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-06754-8_4 · Cited by 2
“Proof systems were first introduced in [18] and have since been extensively studied in both theoretical and practical contexts [20,25,17,5].”
FairRelay: Fair Off-Chain Incentives for Decentralized Physical Infrastructure Networks
Xue, Y., Liu, J., Peng, Z., Lin, C., Hong, J., & Huang, X. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3637286 · Cited by 2
“Specifically, for a claim C , the prover demonstrates knowledge of a private witness w such that for a public parameter x , the statement C ( x, w ) = 1 holds [36].”
On the Impossibility of Actively Secure Distributed Samplers
Abram, D., Fehr, S., Obremski, M., & Schöll, P. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-12290-2_18 · Cited by 2
“This is the case, for instance, with trusted parameters used in many succinct zero-knowledge proofs [BCCT12], or trusted RSA moduli used in cryptographic accumulators [Bd94].”
Scalable zkSNARKs for Matrix Computations: A Generic Framework for Verifiable Deep Learning
Cong, M., Chow, S. S. M., Yiu, S., & Yuen, T. H. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5116-3_12 · Cited by 3
Digital Identity and Personhood Safeguarding Privacy in a Machine World
Gulzar, U. (2025) · International Conference on Intelligent Systems for Cybersecurity (ISCS) · doi:10.1109/iscs69371.2025.11385997 · Cited by 2
“PHCs let individuals prove they control authentic accounts without revealing their identity, while helping service providers detect misleading accounts [25,29]. iv.”
VeriSBOM: Secure and Verifiable SBOM Sharing via Zero-Knowledge Proofs
Castiglione, G., Ebrahimi, S., & Khakpour, N. (2026) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1145/3832783.3834432 · Cited by 2
“Definition 3.1 (Zero-knowledge Argument System) .”
InfluentialCollaborative CP-NIZKs: modular, composable proofs for distributed secrets
Alghazwi, M., Bontekoe, T., Visscher, L., & Türkmen, F. (2026) · International Journal of Information Security · doi:10.1007/s10207-026-01209-1 · Cited by 2
“A non-interactive commitment scheme is a 3-tuple of probabilistic polynomial time (p.p.t.) algorithms: – Setup ( 1 λ ) → ck : Given the security parameter λ , this outputs the commitment key ck , which also describes the input space D , commitment space”
Towards Verifiable AI with Lightweight Cryptographic Proofs of Inference
Anchuri, P., Campanelli, M., Cesaretti, P., Gennaro, R., Jois, T. M., Kayman, H. S., & Ozdemir, T. (2026) · IEEE Conference on Secure and Trustworthy Machine Learning (SaTML) · doi:10.1109/satml68715.2026.00058 · Cited by 3
UDPP: Blockchain based Open Platform as a Privacy Enabler
Pei, X., Li, X., Wu, X., Sun, L., & Cao, Y. (2020) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc47524.2020.9031142 · Cited by 2
Webs of Trust: Choosing Who to Trust on the Internet
Dell’Amico, M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-55196-4_7 · Cited by 2
BlockVerify: Privacy-Preserving Zero-Knowledge Attribute Verification Framework on Ethereum
Constantinides, T., & Cartlidge, J. (2023) · The ...European modeling & simulation symposium · doi:10.46354/i3m.2023.emss.022 · Cited by 2
Pun, T. H., He, Y. J., & Yiu, S. (2024) · Communications in computer and information science · doi:10.1007/978-981-97-1274-8_18 · Cited by 3
Badakhshan, M., & Gong, G. (2023) · IEEE World Forum on Internet of Things (WF-IoT) · doi:10.1109/wf-iot58464.2023.10539396 · Cited by 2
“SNARKs can be modified so that a verifier does not learn anything about the witness then we will have zkSNARKs [54].”
BackgroundInfluentialMPC-in-the-Head Framework without Repetition and its Applications to the Lattice-based Cryptography
Bai, W., Chen, L., Gao, Q., & Zhang, Z. (2024) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp54263.2024.00157 · Cited by 2
“Two main approaches have been proposed: direct construction of a zero-knowledge proof from the algebraic properties of the problem, or using a generic technique like SNARKs [22] or MPCitH [10].”
MethodKe, Z., Meng, B., Zuo, C., & Wang, D. (2025) · Blockchain Research and Applications · doi:10.1016/j.bcra.2025.100413 · Cited by 2
Proof and Argument Based Verifiable Computing
Demirel, D., Schabhüser, L., & Buchmann, J. A. (2017) · SpringerBriefs in computer science · doi:10.1007/978-3-319-53798-6_3 · Cited by 2
Revocable quantum timed-release encryption.Preprint
Unruh, D. (2013) · IACR Cryptology ePrint Archive · Cited by 6
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
Fauzi, P., Lipmaa, H., Siim, J., Zając, M., & Ødegaard, A. T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92068-5_21 · Cited by 2
A Blockchain-based Protocol of Trusted Setup Ceremony for Zero-Knowledge Proof
Park, C., Chung, M., & Ryu, D. (2023) · Blockchain and Internet of Things Conference (BIOTC) · doi:10.1145/3625078.3625083 · Cited by 4
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.