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 401–500 of 544
Blockchain-based Trustless Fair Payment Protocol for Verifiable Confidential Outsourcing Computation
Lee, H. L., Au, M. H., & Sun, S.-F. (2023) · IEEE International Conference on Blockchain (Blockchain) · doi:10.1109/blockchain60715.2023.00045 · Cited by 3
“More generally, Succinct Non-Interactive Argument of Knowledge (SNARK) (e.g. [10]–[13]) allows the proof to be for any NP statement.”
BackgroundBlockchain-based Access Control Protocol with collaborative authenticationPreprint
Ci, L., Zhang, L., Wu, Y., & Wiwatanapataphee, B. (2024) · Research Square · doi:10.21203/rs.3.rs-4413100/v1 · Cited by 2
Greitbauer, P. (2023) · reposiTUm (TU Wien) · doi:10.34726/hss.2023.89142 · Cited by 3
Secure Machine Learning by means of Homomorphic Encryption and Verifiable Computing
Madi, A. (2022) · theses.fr (ABES) · doi:10.70675/805cc7f5z1777z4745z83c5z527db01a5565 · Cited by 2
Locally Verifiable Distributed SNARGs
Tshuva, E. A., Boyle, E., Cohen, R., Moran, T., & Oshman, R. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-48615-9_3 · Cited by 4
Cross-Chain Identity Authentication Protocol based on Group Signature and Zero-Knowledge Proof
Xu, S., Li, D., Wang, L., Mihaljević, M. J., Zhang, S., Shao, W., & Wang, Q. (2025) · International Conference on Computer Supported Cooperative Work in Design (CSCWD) · doi:10.1109/cscwd64889.2025.11033396 · Cited by 1
zkMaP: Zero-Knowledge Succinct Non-Interactive Matrix Multiplication Proofs
Deressa, B., & Hasan, M. A. (2025) · IACR Communications in Cryptology · doi:10.62056/angy11fgx · Cited by 1
Ding, K., Hu, X., Zhou, W., Cheng, G., Li, R., & Wu, H. (2025) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2025.3636014 · Cited by 1
“In 2012, Bitansky et al. [34] proposed zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs), extending the application scope of zero-knowledge proof.”
Decentralized Device Identity: PUF-Driven Soulbound Token Verification for IoT Supply Chain Security
Kasimatis, D., Politis, I., Pitropakis, N., Papadopoulos, P., & Buchanan, W. J. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3642921 · Cited by 2
“Subsequent constructions such as Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge (zk-SNARKs) [28] yield constant-size proofs with fast verification, making them practical for blockchains; Zcash, a cryptocurrency platform, operationalises zk-SNARKs to provide confidential yet…”
zk-OPML: Using zero-knowledge proofs to optimize OPML
Keršič, V., & Turkanović, M. (2026) · Journal of King Saud University - Computer and Information Sciences · doi:10.1007/s44443-026-00573-1 · Cited by 1
“One such technique is zero-knowledge proofs (ZKPs), which allow computational correctness to be veri-fied succinctly and efficiently without re-executing the entire process (Bitansky et al. 2012).”
Exploring the potential for zero-knowledge proofs in supply chain management
Twenhöven, T., Hoberg, K., & Petersen, M. (2026) · Supply Chain Management An International Journal · doi:10.1108/scm-07-2025-0719 · Cited by 1
Sezer, B. B. (2026) · Sakarya University Journal of Computer and Information Sciences · doi:10.35377/saucis...1755063 · Cited by 1
Cao, D., Li, B., Wang, L., Zhang, H., & Wang, Y. (2026) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2026.3687094 · Cited by 1
HyperFond: A Transparent and Post-Quantum Distributed SNARK with Polylogarithmic Communication
Yu, Y., Liu, M., Zhang, Y., Ma, T., Sun, S.-F., Au, M. H., & Gu, D. (2026) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3779208.3805973 · Cited by 2
“Since the seminal work [1] by Bitansky et al., intensive studies have been carried out on SNARK constructions ([2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14] and references therein), focusing on reducing reliance on trusted setups [4, 6, 9, 10, 13], achieving post-quantum security [2, 3, 6, 9, 13,…”
SoK: Anonymous Credentials for Digital Identity Wallets
Bormann, C., & Lehmann, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-19567-8_1 · Cited by 1
Implementation of Verified Set Operation Protocols Based on Bilinear Accumulators
Ferretti, L., Colajanni, M., & Marchetti, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-48965-0_41 · Cited by 1
Succinct Spooky Free Compilers Are Not Black Box Sound
Brakerski, Z., Kalai, Y. T., & Perlman, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70700-6_6 · Cited by 1
“Indeed, it has been shown by Micali [Mic94] and Damg˚ard et al. and Bi-tansky et al. [DFH12, BCCT12, BCCT13, BCC + 14] that in the random oracle model or relying on knowledge assumptions, it is indeed possible.”
MethodGuaranteeing Correctness of Bulk Operations in Outsourced Databases
Ferretti, L., Colajanni, M., & Marchetti, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-41483-6_3 · Cited by 1
“It recasts the problem of verifying the correctness of results produced by an untrusted database in terms of set operations by leveraging an original combination of bilinear map aggregate signatures [7] and extractable collision resistant (ECR) hash functions [4, 8].”
Succinct Malleable NIZKs and an Application to Compact Shuffles
Chase, M., Kohlweiss, M., Meiklejohn, S., & Lysyanskaya, A. (2013) · UCL Discovery (University College London) · Cited by 1
Non-malleable Codes from Authenticated Encryption in Split-State Model
Ghosal, A. K., & RoyChowdhury, D. (2023) · Communications in computer and information science · doi:10.1007/978-981-99-2264-2_2 · Cited by 1
Research progress of verifiable technologies for outsourcing services
Yi, S. U. N., Fan, Y. A. N. G., Xingyuan, C. H. E. N., Du, X., & Wei, L. I. N. (2023) · Scientia Sinica Informationis · doi:10.1360/ssi-2022-0360 · Cited by 1
Verifiable Computing in Avionics for Assuring Computer-Integrity without Replication
Reinhart, J., Luettig, B., Huber, N., Liedtke, J., & Annighoefer, B. (2023) · IEEE/AIAA Digital Avionics Systems Conference (DASC) · doi:10.1109/dasc58513.2023.10311290 · Cited by 1
“Following the definition of Bitansky et al. [29], a Non-Interactive Argument of Knowledge is the set of three algorithms (G vc , P vc , V vc ) : The generator algorithm generates a prover-key κ vc and a verifier-key ˜ κ vc given the circuit C .”
MethodPoster: WIP: Account ZK-Rollups from Sumcheck Arguments
Fernando, R., & Roy, A. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3624405 · Cited by 1
A Simple and Efficient Framework of Proof Systems for NP
Wang, Y., Su, C., Pan, J., & Chen, Y. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8724-5_6 · Cited by 1
Verifiable Multi-Agent Multi-Task Assignment
Lavaur, T., Nedelmann, D. C., Chauffaut, C., Lacan, J., & Chanel, C. P. C. (2024) · IEEE Secure Development Conference (SecDev) · doi:10.1109/secdev61143.2024.00006 · Cited by 1
“This property is induced by the succinctness property of the proofs stating that the proof is efficient in terms of memory space and transmission compared to the initial problem [28].”
BackgroundPrivacy Preserving and Verifiable Outsourcing of AI Processing for Cyber-Physical Systems
Spathoulas, G. P., Katsika, A., & Kavallieratos, G. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-8798-2_15 · Cited by 4
zkMixer: A Configurable Zero-Knowledge Mixer with Anti-Money Laundering Consensus Protocols
Constantinides, T., & Cartlidge, J. (2025) · IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS) · doi:10.1109/dapps65174.2025.00022 · Cited by 2
“Although early ZKPs were impractical for use in smart contracts, recent improvements, such as the introduction of zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) [24], have enabled practical blockchain applications (see Nitulescu [25] for a history of ZKP systems).”
Cryptographic Tools for the Cloud
Gorbunov, S. (2015) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Quantization using jet space geometry and identity management using credential schemes
Ringers, S. (2016) · University of Groningen research database (University of Groningen / Centre for Information Technology) · Cited by 1
Securing Cloud Computations with Oblivious Primitives from Intel SGX
Sasy, S. (2017) · UWSpace (University of Waterloo) · Cited by 1
On deploying succinct zero-knowledge proofs
Virza, M. (2017) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Techniques for scalable secure computation systems
Kreuter (2018) · Digital Repository Service (Northeastern University) · doi:10.17760/d20289523 · Cited by 1
Proof of All: Verifiable Computation in a NutshellPreprint
Barbara, M. A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.02327 · Cited by 1
“SNARKs [72], traceable back to SNARGs [73] and typically based on QAPs (Quadratic Arithmetic Programs) and homomorphic cryptography, have received a lot of attention from researchers, giving birth to many theoretical designs such as: Geppetto [74], Pinocchio [75], Groth’s [76] (most popular”
BackgroundTowards Secure Computation with Optimal Complexity
Miao, P. (2019) · UC Berkeley · Cited by 1
A DLT-based Smart Contract Architecture for Atomic and Scalable TradingPreprint
Kalbantner, J., Markantonakis, K., Hurley-Smith, D., Shepherd, C., & Semal, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.02937 · Cited by 2
“Examples of such systems would be zk-SNARK (zero-knowledge succinct non-interactive argu-ment of knowledge) [50], ring signatures [51], [52], [53] and bulletproofs (non-interactive zero-knowledge proofs) [54].”
BackgroundScalable Zero Knowledge via Cycles of Elliptic Curves.Preprint
Ben‐Sasson, E., Chiesa, A., Tromer, E., & Virza, M. (2014) · IACR Cryptology ePrint Archive · Cited by 5
Self-citationGroth, J. (2023) · Springer eBooks · doi:10.1007/978-3-642-27739-9_1661-1 · Cited by 1
The Price of Smart Contract Privacy
Sguerra, L. M., Jouvelot, P., Coelho, F., Arias, E. J. G., & Memmi, G. (2024) · HAL · Cited by 1
Algorithmique des courbes destinées au contexte de la cryptographie bilinéaire et post-quantique
Masson, S. (2020) · theses.fr (ABES) · doi:10.70675/875fcb93z54aez46dazbaafz2c925a7c6d99 · Cited by 3
When Proofs Meet Hardware: Comparing NTT and SumCheck in Zero-Knowledge SystemsPreprint
Mo, J., Daftardar, A., GaneshKumar, B., Guo, K., Wang, H., Bünz, B., Garg, S., & Reagen, B. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.16146 · Cited by 2
“Modern zkSNARK constructions [9] typically combine a Polynomial Interactive Oracle Proof (PIOP) [8, 10] with a polynomial commitment scheme [32], using the Fiat-Shamir heuristic [22] to remove interaction.”
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems (full version)
Ben‐Sasson, E., Chiesa, A., Genkin, D., & Tromer, E. (2013)
Self-citationEfficient Secure and Verifiable Outsourcing of Matrix Multiplications.
Zhang, Y., & Blanton, M. (2014)
Verifiable set operations over outsourced databases
Canetti, R., Paneth, O., Papadopoulos, D., & Triandopoulos, N. (2013)
Self-citationSuccinct Randomized Encodings and their Applications.Preprint
Boneh, D., Gentry, C., Gorbunov, S., Halevi, S., Nikolaenko, V., Segev, G., Vaikuntanathan, V., & Vinayagamurthy, D. (2014) · IACR Cryptology ePrint Archive · Cited by 2
OCEAN: A Built-In Replacement for Mining Pools.Preprint
Chée, R. P., Chitturi, K., Sans, E. D., & Soska, K. (2019) · IACR Cryptology ePrint Archive · Cited by 1
Black, W., & Henry, R. (2019) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/3338498.3358640
“Finally, we note that there has been a recent flurry of work on SNARKs and SNARGs [5], IOPs [4], and the like.”
BackgroundInfluentialVerifiable Summation of Read-Once Formula Specified Data
He, Y., & Zhang, L. F. (2020) · IEEE Access · doi:10.1109/access.2020.2970067
“There are many emerging solutions [4], [15]–[18] for securely outsourcing computations.”
BackgroundHow to Construct Rational Protocols with Nash Equilibrium Consistency in the UC framework.Preprint
Jiang, X., & Tian, Y. (2019) · IACR Cryptology ePrint Archive
Practical homomorphic macs for arithmetic circuits
Catalano, D., & Fiore, D. (n.d.)
Generalizing Homomorphic MACs for Arithmetic Circuits
Catalano, D., Fiore, D., Gennaro, R., & Nizzardo, L. (2014)
Verifiable Oblivious Storage.Preprint
Apon, D., Katz, J. I., Shi, E., & Thiruvengadam, A. (2014) · IACR Cryptology ePrint Archive
Sichere, verifizierbare Objektidentitäten als Wegbereiter für Wertschöpfung in Verteilten Netzwerken
Wöhnert, K. H., Wöhnert, S.-J., & Skwarek, V. (2021) · Springer eBooks · doi:10.1007/978-3-662-62915-4_13
Interaction-Preserving Compilers for Secure Computation
Döttling, N., Goyal, V., Malavolta, G., & Raizes, J. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2022.57
“Since the witness for such a proof contains the input of the respective party, we have to use succinct arguments [38, 7, 8] to implement these proofs.”
MethodAlshihri, S., Park, W., & Park, S. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-030-98012-2_57
Roth, U., Grandjean, T., Nicolas, D., Imeri, A., & Watrinet, M.-L. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-030-98012-2_59
A Two-Way Atomic Exchange Protocol for Peer-to-Peer Data Trading
Wang, Z.-J., Huang, C.-C. J., Liao, S.-W., & Yuan, Z.-S. S. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-10467-1_27 · Cited by 1
FIAT: Fine-grained Information Audit for Trustless Transborder Data FlowPreprint
Zheng, S., Lin, Y., Yu, Y., Yuan, Y., Jia, Y., & Liu, X. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2209.11451
“zk-SNARK [26], known as zero-knowledge succinct non-interactive arguments of knowledge, is a set of recent ZKP protocols that achieves”
Secure, Verifiable Object Identities as Enablerfor Value Creation in Distributed Networks
Wöhnert, K. H., Wöhnert, S.-J., & Skwarek, V. (2023) · Springer eBooks · doi:10.1007/978-3-662-66509-1_13
Extending Expressive Access Policies with Privacy Features
More, S., Ramacher, S., Alber, L., & Herzl, M. (2022) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom56396.2022.00084
“Third, we automatically compile the policies into the corresponding circuits for SNARK-based zero-knowledge proofs [15].”
MethodWarman, D., Tien, D., & Kabir, M. A. (2023) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc58545.2023.10327991
“…style of blockchain but with one key factor, they much like the goal of this research took an aim at user security employing ZK-SNARK, which is a type of Zero Knowledge security that was originally proposed in 2012 [18] and is the only paper studied that utilised this approach for academic records.”
MethodYeh, L., Jian, J.-Q., & Hu, J.-W. (2023) · IEEE Conference on Dependable and Secure Computing (DSC) · doi:10.1109/dsc61021.2023.10354239
“For example, Murtaza et al. [10] employed zk-SNARK [11] to verify the identity of voters.”
BackgroundMethodNon-malleable Codes from Leakage Resilient Cryptographic Primitives
Ghosal, A. K., & RoyChowdhury, D. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-0945-8_15
The arithmetic of pairing-based proof systems
Housni, Y. E. (2022) · theses.fr (ABES) · doi:10.70675/0776aaa9zb968z4655z901ez6896e0e751b0
Toward Achieving Anonymous Non-Fungible Tokens in Trustless Environment
Chen, Z., & Omote, K. (2023) · doi:10.1145/3651655.3651664
Neutrosophic One-Round Zero-Knowledge Proof
Sobrinho, R. P., & Smarandache, F. (2024) · Plithogenic Logic and Computation · doi:10.61356/j.plc.2024.2363
A Decentralized Approach to Award Game Achievements
Bruschi, F., Sciuto, D., Paulon, T., & Marchesi, A. (2024) · Distributed Ledger Technologies Research and Practice · doi:10.1145/3705614
Multi-key Fully-Homomorphic Aggregate MAC for Arithmetic Circuits
Biswas, S., & Yerukhimovich, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-80308-6_10
Groth, J. (2025) · Springer eBooks · doi:10.1007/978-3-030-71522-9_1661 · Cited by 1
A Univariate Attack Against the Limited-Data Instance of Ciminion
Bariant, A. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-82841-6_7
“Some ZK proof systems and MPC protocols operate on large finite fields F q with q prime or power of 2 [10,15,16,7].”
BackgroundOptimizing Zero-Knowledge Proofs for Secure Educational Data Storage on Blockchain
Warman, D., Tien, D., & Kabir, M. A. (2024) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc63072.2024.10935242
“Non-Interactive Argument of Knowledge) zk-SNARKs, a term first coined in 2011 [13], are the basis on which non-interactive ZKPs have been built. zk-SNARKS are best known for their use in the ZeroCash cryptocurrency [19] where it was shown that they could be used to provide full pri-vatisation for…”
Kaal, W. A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5225296
Generic Privacy-Aware Cross-Chain Framework
Jiang, P., & Zhu, L. (2025) · Springer eBooks · doi:10.1007/978-981-96-4395-0_7
CoBBL: Dynamic Constraint Generation for SNARKs
Jiang, K., Brown, F., & Wahby, R. S. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00200 · Cited by 3
“People are really excited about SNARKs [14, 17, 37, 41, 44].”
Sun, J., Zhao, R., Lin, L., Chi, Y., Leung, V. C. M., & Cai, W. (2025) · IEEE Systems Man and Cybernetics Magazine · doi:10.1109/msmc.2024.3482691 · Cited by 1
“…Argument of Knowledge (zk-SNARK) represents a particular form of ZKP characterized by its compact proof size and efficient verification [18]. zk-SNARKs offer a concise and effective method for validating computation accuracy, thereby lessening the computational load on verification entities [19].”
Secure Protocol for Remote Testing Critical Systems Over Public Networks Using Zero-Knowledge Proofs
Germino, S., Menéndez, M. N., & Lutenberg, A. (2025) · IEEE Embedded Systems Letters · doi:10.1109/les.2025.3589547
Lumi: Lightweight Blockchain Layer 2 Protocol from On-chain Coordination
Wang, X., Cao, S., Jia, K., You, Q., & Duan, S. (2025) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs63083.2025.00059
“Cryptographic approaches such as zero-knowledge proofs [10], [11] are used to prove the correctness of the execution results [6]–[8].”
Saraswat, S., Kanwar, K., Kaur, R., Sen, P., Lamba, M., & Arora, H. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-96-7760-3_32
A Distributed Approach to Privacy-Preserving Location Verification Using Blockchain and zk-SNARKs
Naidu, P. R., Sriranjini, K. S., Sharan, T. D., Singh, R., & Upadhyaya, D. R. (2025) · International Conference on Networks, Multimedia and Information Technology (NMITCON) · doi:10.1109/nmitcon65824.2025.11188408
Impact of Coalesce Access Control Mechanisms in Distributed Ledger Technology
Noorain, A., Ahmad, K., & Ricci, L. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-032-02949-2_5
ZeKSA: Zero-knowledge Secured Anonymous IoT Resource Sharing on Blockchain
Yasir, M., & Kalkan, K. (2025) · International Conference on Blockchain Computing and Applications (BCCA) · doi:10.1109/bcca66705.2025.11229543
ExPrESSO: Zero-Knowledge Backed Extensive Privacy Preserving Single Sign-On
Barman, K., Piper, F., Pandey, S. R., Vaziry, A., & Küpper, A. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-24807-7_43
“Hence, the term Succinct Non-Interactive Argument of Knowledge (SNARK) was coined with efficient proofs for the verifier, but still computational overhead for the prover was orders of magnitude too high [4][27].”
Njike, G. N., Hoang, A.-T., & Schulte, S. (2025) · IEEE International Conference on Blockchain (Blockchain) · doi:10.1109/blockchain67634.2025.00029
“A zk-SNARK [11] is a cryptographic primitive that allows a prover to convince a verifier that a statement is correct without revealing any sensitive information about it. zk-SNARKs rely on various proving systems (e.g., Groth16 [16], Halo2 [17]) but their workflow has the common four steps: circuit…”
Χρήση κρυπτογραφικών μεθόδων στην τεχνολογία Blockchain
Κομηνέας, Θ. (2022) · Institutional Repository Hellanicus · doi:10.26215/heal.uoa.6312
Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge
Cheng, J., & Goyal, R. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2025.56 · Cited by 1
“Over the last decade, many more succinct SNARG schemes have been designed [6, 7, 22, 39, 23, 8, 5], however these rely on non-falsifiable assumptions [36] 2 .”
Blockchain for Secure Identity Management: A Review on Decentralized Authentication Systems
Studies(JGRMS), J. O. G. R. I. M. (2025) · Journal of Global Research in Multidisciplinary Studies(JGRMS) · doi:10.5281/zenodo.15244312
On the average-case hardness of total search problems
Kamath, C. (2020) · Institute of Science and Technology Austria · doi:10.15479/at:ista:7896
Morais, T. A. P. (2024) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)
Zero-Knowledge Inclusion Proofs
Bögli, R. (2023) · HSR (HSR University of Applied Sciences Rapperswil) · Cited by 1
Constructions for Multi-Party Computation Based on Secret Sharing and Homomorphic Encryption
Lu, Y. (2024) · Institutional Repositories DataBase (IRDB)
Nguyen Nhan, T. (2024) · MOnAMi (Hochschule Mittweida Hochschulbibliothek)
Succinct Arguments for $$\textsf{Batch}\textsf{QMA}$$ and Friends Under 8 Rounds
Goyal, R., Jain, A., & B, S. M. G. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-01878-6_20
Cache Timing Leakages in Zero-Knowledge Protocols
Mukherjee, S., Rechberger, C., & Schofnegger, M. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.aft.2025.1
“More specifically, most ZKP applications rely on the technique of zero-knowledge succinct non-interactive argument of knowledge (zkSNARK) [BCCT12, AHIV17, GLS + 23, XZS22] for sub-linear proof size and verification time.”
The 5 W’s of Zero-Knowledge Proof Development
van Niekerk, N., van der Merwe, B., & Labuschagne, L. (2025) · JUCS - Journal of Universal Computer Science · doi:10.3897/jucs.133397
Demo: Verify, Don’t Trust: Open-Source AI Is Not Enough
Keršič, V., Heričko, M., & Turkanović, M. (2025) · Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS) · doi:10.1109/brains67003.2025.11302934
“In AI, this is addressed through verifiable machine learning approaches such as zero-knowledge ML (ZKML) [10], [11] and optimistic ML (OPML) [12].”
Air-FRI: Acceleration of the FRI Protocol on the GPU for ZkSNARK Applications
Jandhyala, T., & Gong, G. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-10536-3_12
“…Non-Interactive Arguments (SNARGs) to enhance efficiency by reducing proof sizes and verification times, which paved way for Bitansky et al. [16] to formalize SNARKs using assumptions like extractable collision-resistant hash functions. zkSNARKs, an advanced class of non-interactive proofs,…”
Secure and efficient design of lattice-based cryptography
Land, G. (2026) · Dokumentenrepositorium der RUB (Ruhr University Bochum) · doi:10.13154/294-13801
Cross-Chain Privacy-Preserving Auditable Protocol
Jiang, P., Liu, J., Liu, Q., & Zhu, L. (2025) · ACM International Symposium on Blockchain and Secure Critical Infrastructure (BSCI) · doi:10.1145/3709016.3737804 · Cited by 1
Decentralized architectures for privacy-enhanced service provisioning in computing services
Ballesteros-Rodríguez, A. (2024) · e_Buah
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.