On the Size of Pairing-Based Non-interactive Arguments

Identity-Based Cryptosystems and Signature Schemes

Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_5 · Cited by 6,648 · see citing works

The 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 · see citing works

Zerocash: Decentralized Anonymous Payments from Bitcoin

Ben‐Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.36 · Cited by 1,987 · see citing works

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps

Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_26 · Cited by 1,871 · see citing works

Efficient Non-interactive Proof Systems for Bilinear Groups

Groth, J., & Sahai, A. (2008) · Springer eBooks · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,078 · see citing works

Non-interactive zero-knowledge and its applications

Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904 · see citing works

Pinocchio: 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 · see citing works

Pairings for cryptographers

Galbraith⋆, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 800 · see citing works

Quadratic Span Programs and Succinct NIZKs without PCPs

Gennaro, R., Gentry, C., Parno, B. J., & Raykova, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_37 · Cited by 751 · see citing works

A note on efficient zero-knowledge proofs and arguments (extended abstract)

Kilian, J. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129782 · Cited by 604 · see citing works

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., & Virza, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_6 · Cited by 598 · see citing works

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

Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493 · see citing works

Separating succinct non-interactive arguments from all falsifiable assumptions

Gentry, C., & Wichs, D. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993651 · Cited by 456 · see citing works

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

Groth, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_19 · Cited by 441 · see citing works

Succinct non-interactive zero-knowledge for a von Neumann architecture

Ben‐Sasson, E., Chiesa, A., Tromer, E., & Virza, M. (2014) · Cited by 426 · see citing works

Computationally sound proofs

Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424 · see citing works

Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures

Groth, J. (2006) · Lecture notes in computer science · doi:10.1007/11935230_29 · Cited by 390 · see citing works

Sequential Aggregate Signatures from Trapdoor Permutations

Lysyanskaya, A., Micali, S. M., Reyzin, L., & Shacham, H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_5 · Cited by 314 · see citing works

Recursive composition and bootstrapping for SNARKS and proof-carrying data

Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488623 · Cited by 305 · see citing works

Succinct Non-interactive Arguments via Linear Interactive Proofs

Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., & Ostrovsky, R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36594-2_18 · Cited by 285 · see citing works

On the Security of Certificateless Signature Schemes from Asiacrypt 2003

Huang, X., Susilo, W., Mu, Y., et al. (2005) · Lecture notes in computer science · doi:10.1007/11599371_2 · Cited by 262 · see citing works

Generic Construction of Certificateless Signature

Yum, D. H., & Lee, P. J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27800-9_18 · Cited by 225 · see citing works

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

Lipmaa, H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_10 · Cited by 223 · see citing works

Key Replacement Attack Against a Generic Construction of Certificateless Signature

Hu, B. C., Wong, D. S., Zhang, Z., et al. (2006) · Lecture notes in computer science · doi:10.1007/11780656_20 · Cited by 197 · see citing works

Geppetto: Versatile Verifiable Computation

Costello, C., Cédric Fournet, A., Howell, J., Kohlweiss, M., Kreuter, B., Naehrig, M., Parno, B. J., & Zahur, S. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.23 · Cited by 195 · see citing works

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 · see citing works

Non-interactive Zaps and New Techniques for NIZK

Groth, J., Ostrovsky, R., & Sahai, A. (2006) · Lecture notes in computer science · doi:10.1007/11818175_6 · Cited by 190 · see citing works

Scalable Zero Knowledge via Cycles of Elliptic Curves

Ben‐Sasson, E., Chiesa, A., Tromer, E., & Virza, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44381-1_16 · Cited by 190 · see citing works

Energy aware lossless data compression

Barr, K. C., & Asanović, K. (2003) · International Conference on Mobile Systems, Applications, and Services · doi:10.1145/1066116.1066123 · Cited by 180 · see citing works

Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency

Valiant, P. (2008) · Springer eBooks · doi:10.1007/978-3-540-78524-8_1 · Cited by 175 · see citing works

New Techniques for Noninteractive Zero-Knowledge

Groth, J., Ostrovsky, R., & Sahai, A. (2012) · Journal of the ACM · doi:10.1145/2220357.2220358 · Cited by 159 · see citing works

Two Certificateless Aggregate Signatures From Bilinear Maps

Gong, Z., Long, Y., Hong, X., et al. (2007) · ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) · doi:10.1109/snpd.2007.132 · Cited by 131 · see citing works

Perfect NIZK with Adaptive Soundness

Abe, M., & Fehr, S. (2007) · Springer eBooks · doi:10.1007/978-3-540-70936-7_7 · Cited by 109 · see citing works

Linear Algebra with Sub-linear Zero-Knowledge Arguments

Groth, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_12 · Cited by 105 · see citing works

Square Span Programs with Applications to Succinct NIZK Arguments

Danezis, G., Cédric Fournet, A., Groth, J., & Kohlweiss, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45611-8_28 · Cited by 104 · see citing works

Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

Lipmaa, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42033-7_3 · Cited by 98 · see citing works

On the existence of extractable one-way functions

Bitansky, N., Canetti, R., Paneth, O., et al. (2014) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2591796.2591859 · Cited by 98 · see citing works

Pinocchio coin

Danezis, G., Cédric Fournet, A., Kohlweiss, M., & Parno, B. J. (2013) · doi:10.1145/2517872.2517878 · Cited by 96 · see citing works

Signature Bouquets: Immutability for Aggregated/Condensed Signatures

Mykletun, E., Narasimha, M., & Tsudik, G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30108-0_10 · Cited by 89 · see citing works

Efficient Certificateless Signature Schemes

Choi, K. Y., Park, J. H., Hwang, J. Y., et al. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72738-5_29 · Cited by 84 · see citing works

A New ID-based Signature with Batch Verification.Preprint

Cheon, J. H., Kim, Y., & Yoon, H. (2004) · IACR Cryptology ePrint Archive · Cited by 69 · see citing works

ID-Based Aggregate Signatures from Bilinear Pairings

Xu, J. M., Zhang, Z., & Feng, D. (2005) · Lecture notes in computer science · doi:10.1007/11599371_10 · Cited by 60 · see citing works

Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures

Abe, M., Groth, J., Ohkubo, M., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54242-8_29 · Cited by 57 · see citing works

Cluster Computing in Zero Knowledge

Chiesa, A., Tromer, E., & Virza, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46803-6_13 · Cited by 52 · see citing works

Limits of Extractability Assumptions with Distributional Auxiliary Input

Boyle, E., & Pass, R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48800-3_10 · Cited by 49 · see citing works

Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation

Schoenmakers, B., Veeningen, M., & de Vreede, N. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39555-5_19 · Cited by 32 · see citing works

A System for End-to-End Authentication of Adaptive Multimedia Content

Suzuki, T., Ramzan, Z., Fujimoto, H., et al. (2005) · Springer eBooks · doi:10.1007/0-387-24486-7_18 · Cited by 18 · see citing works

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs

Bitansky, N., Chiesa, A., Ishai, Y., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36594-2_41 · Cited by 14 · see citing works

Identity-based multisignature and aggregate signature schemes from m-torsion groups

Cheng, X., Liu, J., Guo, L., et al. (2006) · Journal of Electronics (China) · doi:10.1007/s11767-004-0178-z · Cited by 14 · see citing works

Trinocchio : privacy-friendly outsourcing by distributed verifiable computation

Schoenmakers, B., Veeningen, M. M., & Vreede, D. N. N. (2015) · Cited by 5 · see citing works

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 · see citing works

A Survey of Self-Sovereign Identity Ecosystem

Soltani, R., Nguyen, U. T., & An, A. (2021) · Security and Communication Networks · doi:10.1155/2021/8873429 · Cited by 131 · see citing works

zkDL: Efficient Zero-Knowledge Proofs of Deep Learning Training

Sun, H., Bai, T., Li, J., & Zhang, H. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3520863 · Cited by 33 · see citing works

AZR: Risk-Adaptive Verification for Decentralized AI Inference on Blockchain Rollups

Virani, A. (2026) · Zenodo · doi:10.5281/zenodo.20703363

Zero-knowledge proofs of knowledge without interaction

Santis, A. D., & Persiano, G. (1992) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267809 · Cited by 162 · see citing works

Physical Zero-Knowledge Proof for Sukoro

Sasaki, S., & Shinagawa, K. (2024) · New Generation Computing · doi:10.1007/s00354-024-00271-4 · Cited by 6 · see citing works

Zero Knowledge Proofs for NP

Kun, J. (2016) · doi:10.59350/smrdp-j9c24

Comparative study of diverse zero-knowledge argument systems

Kuriakose, J., Sisodia, P. S., Amruth, V., et al. (2016) · doi:10.1109/sapience.2016.7684134 · Cited by 2 · see citing works

Efficient card-based zero-knowledge proof for Sudoku

Sasaki, T., Miyahara, D., Mizuki, T., et al. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.05.036 · Cited by 71 · see citing works