Pinocchio: Nearly Practical Verifiable Computation
Open accessAbstract
To instill greater confidence in computations outsourced to the cloud, clients should be able to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions. With Pinocchio, the client creates a public evaluation key to describe her computation; this setup is proportional to evaluating the computation once. The worker then evaluates the computation on a particular input and uses the evaluation key to produce a proof of correctness. The proof is only 288 bytes, regardless of the computation performed or the size of the inputs and outputs. Anyone can use a public verification key to check the proof. Crucially, our evaluation on seven applications demonstrates that Pinocchio is efficient in practice too. Pinocchio's verification time is typically 10ms: 5-7 orders of magnitude less than previous work; indeed Pinocchio is the first general-purpose system to demonstrate verification cheaper than native execution (for some apps). Pinocchio also reduces the worker's proof effort by an additional 19-60x. As an additional feature, Pinocchio generalizes to zero-knowledge proofs at a negligible cost over the base protocol. Finally, to aid development, Pinocchio provides an end-to-end toolchain that compiles a subset of C into programs that implement the verifiable computation protocol.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
[118] proposed a multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK, which is the baseline for Zcash.
“In this direction, [118] proposed a multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK [95], which is the baseline for Zcash [17].”
From Privacy-Preserving Solutions for Blockchain: Review and Challenges (2019) · cites this paper as [95]
Pinocchio by Parno et al. in 2013 applies ZKP to real-life use cases.
“Pinocchio by Parno et al. in 2013 which applies ZKP to reallife use cases [128]”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [128]
Man-in-the-Middle attacks intercept the models exchanged between the clients and the server and replace them with malicious model updates.
“Man-in-the-Middle attacks [84], [85] intercept the models exchanged between the clients and the server and replace them with malicious model updates.”
From Vulnerabilities in federated learning (2021) · cites this paper as [85]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Adomavičius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,347 · see citing works
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403 · see citing works
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,098 · see citing works
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,540 · 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
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475 · see citing works
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,359 · see citing works
Self-citationProof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,449 · see citing works
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,448 · see citing works
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture notes in computer science · doi:10.1007/11426639_26 · Cited by 1,342 · see citing works
SETI@home: an experiment in public-resource computing
Anderson, D. P., Cobb, J., Korpela, E., Lebofsky, M., & Werthimer, D. (2002) · Communications of the ACM · doi:10.1145/581571.581573 · Cited by 1,302 · see citing works
Probabilistic checking of proofs
Arora, S., & Safra, M. (1998) · Journal of the ACM · doi:10.1145/273865.273901 · Cited by 1,158 · see citing works
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,156 · see citing works
Self-citationProofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_19 · Cited by 1,148 · 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
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. R. (2005) · Lecture notes in computer science · doi:10.1007/11535218_16 · Cited by 1,051 · see citing works
Self-citationDesign and implementation of a TCG-based integrity measurement architecture
Sailer, R., Zhang, X., Jaeger, T., & van Doorn, L. (2004) · USENIX Security Symposium · Cited by 1,041 · see citing works
Pairing-Friendly Elliptic Curves of Prime Order
Barreto, P. S. L. M., & Naehrig, M. (2006) · Lecture notes in computer science · doi:10.1007/11693383_22 · Cited by 880 · see citing works
Lattice-Gas Cellular Automata and Lattice Boltzmann Models: An Introduction
Wolf-Gladrow, D. A. (2000) · Helmholtz-Zentrum für Polar-und Meeresforschung (Alfred-Wegener-Institut) · doi:10.1007/b72010 · Cited by 862 · see citing works
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_49 · Cited by 800 · see citing works
Self-citationFairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 791 · 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
Self-citationA 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 611 · see citing works
Architectural support for copy and tamper resistant software
Lie, D., Codesourcery, M. M., Lincoln, P. D., Boneh, D., Mitchell, J. C., & Horowitz, M. (2000) · ACM SIGARCH Computer Architecture News · doi:10.1145/378995.379237 · Cited by 597 · see citing works
Faster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 566 · see citing works
Goldwasser, S., Kalai, Y. T., & Rothblum, G. N. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374396 · Cited by 484 · 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
Self-citationShort 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 454 · see citing works
Blum, M., Santis, A. D., Micali, S. M., & Persiano, G. (1991) · SIAM Journal on Computing · doi:10.1137/0220068 · Cited by 427 · see citing works
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424 · see citing works
Improved Delegation of Computation Using Fully Homomorphic Encryption
Chung, K.-M., Kalai, Y. T., & Vadhan, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_26 · Cited by 404 · see citing works
Relations Among Complexity Measures
Pippenger, N. J., & Fischer, M. J. (1979) · Journal of the ACM · doi:10.1145/322123.322138 · Cited by 388 · see citing works
On Cryptographic Assumptions and Challenges
Naor, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_6 · Cited by 364 · see citing works
Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks
Damgård, I. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_36 · Cited by 358 · see citing works
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
Parno, B. J., Raykova, M., & Vaikuntanathan, V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_24 · Cited by 355 · see citing works
Self-citationPrivacy-preserving smart metering
Rial, A., & Danezis, G. (2011) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/2046556.2046564 · Cited by 314 · see citing works
Uncheatable Distributed Computations
Golle, P., & Mironov, I. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45353-9_31 · Cited by 256 · see citing works
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
Bellare, M., & Palacio, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28628-8_17 · Cited by 236 · see citing works
Architectural Support for Copy and Tamper Resistant Software
Lie, D., Thekkath, C. A., Codesourcery, M. M., Lincoln, P. D., & Boneh, D. (2000) · doi:10.21236/ada419599 · Cited by 210 · see citing works
Practical verified computation with streaming interactive proofs
Cormode, G., Mitzenmacher, M., & Thaler, J. (2012) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2090236.2090245 · Cited by 201 · see citing works
A protocol for property-based attestation
Chen, L., Landfermann, R., Löhr, H., Rohe, M., Sadeghi, A., & Stüble, C. (2006) · Scalable Trusted Computing · doi:10.1145/1179474.1179479 · Cited by 192 · see citing works
Architecture for Protecting Critical Secrets in Microprocessors
Lee, R. B.-L., Kwan, P. C. S., McGregor, J. P., Dwoskin, J. S., & Wang, Z. (2005) · ACM SIGARCH Computer Architecture News · doi:10.1145/1080695.1069971 · Cited by 168 · see citing works
Making argument systems for outsourced computation practical (sometimes)
Setty, S., McPherson, R., Blumberg, A. J., & Walfish, M. (2012) · Cited by 151 · see citing works
Sadeghi, A., Schneider, T. H., & Winandy, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13869-0_30 · Cited by 146 · see citing works
Query execution assurance for outsourced databases
Sion, R. (2005) · Cited by 142 · see citing works
A Hybrid Architecture for Interactive Verifiable Computation
Vu, V., Setty, S., Blumberg, A. J., & Walfish, M. (2013) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2013.48 · Cited by 140 · see citing works
Architecture for Protecting Critical Secrets in Microprocessors
Lee, R. B.-L., Kwan, P. C. S., McGregor, J. P., Dwoskin, J. S., & Wang, Z. (2005) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2005.14 · Cited by 138 · see citing works
Taking proof-based verified computation a few steps closer to practicality
Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A. J., & Walfish, M. (2012) · Cited by 131 · see citing works
Resolving the conflict between generality and plausibility in verified computation
Setty, S., Braun, B., Vu, V., Blumberg, A. J., Parno, B. J., & Walfish, M. (2013) · European Conference on Computer Systems · doi:10.1145/2465351.2465359 · Cited by 128 · see citing works
Self-citationSecure two-party computations in ANSI C
Holzer, A., Franz, M., Katzenbeisser, S., & Veith, H. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382278 · Cited by 125 · see citing works
Efficient Arguments without Short PCPs
Ishai, Y., Eyal Kushilevitz, Z., & Ostrovsky, R. (2007) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2007.10 · Cited by 123 · see citing works
Gennaro, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28628-8_14 · Cited by 106 · see citing works
New Software Speed Records for Cryptographic Pairings
Naehrig, M., Niederhagen, R., & Schwabe, P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14712-8_7 · Cited by 106 · see citing works
Secure Computation on Floating Point Numbers.
Aliasgari, M., Blanton, M., Zhang, Y., & Steele, A. (2012) · Cited by 98 · see citing works
Distributed Execution with Remote Audit.
Monrose, F., Wyckoff, P., & Rubin, A. D. (1999) · Cited by 97 · see citing works
Bootstrapping Trust in Modern Computers
Parno, B. J., McCune, J. M., & Perrig, A. (2011) · SpringerBriefs in computer science · doi:10.1007/978-1-4614-1460-5 · Cited by 69 · see citing works
Self-citationSecure Distributed Computing in a Commercial Environment
Golle, P., & Stubblebine, S. G. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46088-8_23 · Cited by 68 · see citing works
Chen, Y., & Sion, R. (2011) · ACM Symposium on Cloud Computing (SoCC) · doi:10.1145/2038916.2038945 · Cited by 67 · see citing works
Proofs of partial knowledge and simplified design of witness hiding protocols
Cramer, R., Damgård, I., & Schoenmakers, L. B. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 56 · see citing works
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Σ-Protocols
Almeida, J. B., Bangerter, E., Barbosa, M., Krenn, S., Sadeghi, A., & Schneider, T. H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15497-3_10 · Cited by 52 · see citing works
Billion-Gate Secure Computation with Malicious Adversaries
Kreuter, B., Shelat, A. A., & Shen, C.-H. (2012) · Cited by 52 · see citing works
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
Meiklejohn, S., Erway, C. C., Küpçü, A., Hinkle, T., & Lysyanskaya, A. (2010) · doi:10.13140/rg.2.1.2367.9767 · Cited by 51 · see citing works
Searching for High-Value Rare Events with Uncheatable Grid Computing
Du, W. K., & Goodrich, M. T. (2005) · Lecture notes in computer science · doi:10.1007/11496137_9 · Cited by 32 · see citing works
On the Evaluation of Powers and Related Problems (Preliminary Version)
Pippenger, N. J. (1976) · Cited by 27 · see citing works
Verifiable Computation with Massively Parallel Interactive ProofsPreprint
Thaler, J., Roberts, M., Mitzenmacher, M., & Pfister, H. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.1350 · Cited by 27 · see citing works
Secure Remote Execution of Sequential Computations
Karame, G., Strasser, M., & Čapkun, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-11145-7_15 · Cited by 26 · see citing works
Uncheatable Reputation for Distributed Computation Markets
Cărbunar, B., & Sion, R. (2006) · Lecture notes in computer science · doi:10.1007/11889663_7 · Cited by 12 · see citing works
Flagged first, then by citations
5 of the 72 references couldn’t be matched to a known paper.
Research works printed but not linked: 3
- A. Seshadri, M. Luk, E. Shi, A. Perrig, L. VanDoorn, and P. Khosla, "Pioneer: Verifying integrity and guaranteeing execution of code on legacy platforms," in Proc. of the ACM SOSP, 2005.
- N. Pippenger and M. J. Fischer, "Relations among complexity mea- sures," J. ACM, vol. 26, no. 2, 1979.
- M. Backes, M. Maffe, and K. Pecina, "Automated synthesis of privacy- preserving distributed applications," in Proc. of ISOC NDSS, 2012.
Cited by
Sorted by citations
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
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 · see citing works
A Survey on the Edge Computing for the Internet of Things
Yu, W., Liang, F., He, X., Hatcher, W. G., Lu, C., Lin, J., & Yang, X. (2018) · IEEE Access · doi:10.1109/access.2017.2778504 · Cited by 1,520 · see citing works
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 · see citing works
On Scaling Decentralized Blockchains
Croman, K., Decker, C., Eyal, I., Gencer, A. E., Juels, A., Kosba, A. E., Miller, A. E., Saxena, P., Shi, E., Sirer, E. G., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53357-4_8 · Cited by 1,199 · 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
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
Self-citationVC3: Trustworthy Data Analytics in the Cloud Using SGX
Schuster, F., Costa, M., Cédric Fournet, A., Gkantsidis, C., Peinado, M., Mainar-Ruiz, G., & Russinovich, M. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.10 · Cited by 594 · see citing works
Security and Privacy Issues of Fog Computing: A Survey
Yi, S., Qin, Z., & Li, Q. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21837-3_67 · Cited by 529 · see citing works
Privacy-Preserving Solutions for Blockchain: Review and Challenges
Bernal Bernabe, J., Canovas, J. L., Hernandez-Ramos, J. L., Torres Moreno, R., & Skarmeta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2950872 · Cited by 430 · 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
Boneh, D., Bonneau, J., Bünz, B., & Fisch, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96884-1_25 · Cited by 424 · see citing works
Rafique, W., Qi, L., Yaqoob, I., Imran, M. A., Rasool, R. U., & Dou, W. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2997475 · Cited by 365 · see citing works
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Bootle, J., Cerulli, A., Chaidos, P., Groth, J., & Petit, C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5_12 · Cited by 337 · see citing works
Aurora: Transparent Succinct Arguments for R1CS
Ben‐Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., & Ward, N. P. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-17653-2_4 · Cited by 340 · see citing works
Permacoin: Repurposing Bitcoin Work for Data Preservation
Miller, A. E., Juels, A., Shi, E., Parno, B. J., & Katz, J. I. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.37 · Cited by 309 · see citing works
Self-citationSmart Meter Data Privacy: A Survey
Asghar, M. R., Dán, G., Miorandi, D., & Imrich Chlamtac, A. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2720195 · Cited by 309 · see citing works
Maller, M., Bowe, S., Kohlweiss, M., & Meiklejohn, S. (2019) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3319535.3339817 · Cited by 308 · see citing works
Private predictive analysis on encrypted medical data
Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283 · see citing works
Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup
Setty, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56877-1_25 · Cited by 279 · see citing works
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
Khalilov, M. C. K., & Levi, A. W. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2818623 · Cited by 273 · see citing works
Doubly-Efficient zkSNARKs Without Trusted Setup
Wahby, R. S., Tzialla, I., Shelat, A., Thaler, J., & Walfish, M. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00060 · Cited by 276 · see citing works
Ben‐Sasson, E., Chiesa, A., & Spooner, N. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53644-5_2 · Cited by 259 · see citing works
Leveled Fully Homomorphic Signatures from Standard Lattices
Gorbunov, S., Vaikuntanathan, V., & Wichs, D. (2015) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2746539.2746576 · Cited by 255 · see citing works
Vulnerabilities in federated learning
Bouacida, N., & Mohapatra, P. (2021) · IEEE Access · doi:10.1109/access.2021.3075203 · Cited by 248 · see citing works
ZoKrates - Scalable Privacy-Preserving Off-Chain Computations
Eberhardt, J., & Tai, S. (2018) · IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/cybermatics_2018.2018.00199 · Cited by 240 · see citing works
Efficiently Verifiable Computation on Encrypted Data
Fiore, D., Gennaro, R., & Pastro, V. (2014) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2660267.2660366 · Cited by 237 · see citing works
Demystifying Incentives in the Consensus Computer
Luu, L., Teutsch, J., Kulkarni, R., & Saxena, P. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813659 · Cited by 234 · see citing works
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Katz, J. I., Kolesnikov, V., & Wang, X. S. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243805 · Cited by 232 · see citing works
On or Off the Blockchain? Insights on Off-Chaining Computation and Data
Eberhardt, J., & Tai, S. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67262-5_1 · Cited by 229 · see citing works
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project
Stebila, D., & Mosca, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69453-5_2 · Cited by 232 · see citing works
Dziembowski, S., Eckey, L., & Faust, S. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243857 · Cited by 224 · see citing works
Xu, C. L., Zhang, C., & Xu, J. (2019) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3299869.3300083 · Cited by 222 · see citing works
MIStore: a Blockchain-Based Medical Insurance Storage System
Zhou, L., Wang, L., & Sun, Y. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0996-4 · Cited by 217 · see citing works
Cryptographic primitives in blockchains
Wang, L., Shen, X., Li, J., Shao, J., & Yang, Y. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.11.003 · Cited by 211 · see citing works
Practical verified computation with streaming interactive proofs
Cormode, G., Mitzenmacher, M., & Thaler, J. (2012) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2090236.2090245 · Cited by 201 · see citing works
Scalable Zero Knowledge with No Trusted Setup
Ben‐Sasson, E., Bentov, I., Horesh, Y., & Riabzev, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26954-8_23 · Cited by 206 · see citing works
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., & Song, D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26954-8_24 · Cited by 199 · 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
Self-citationVerifiable delegation of computation on outsourced data
Michael Backes, A., Fiore, D., & Reischuk, R. M. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516681 · Cited by 195 · see citing works
Prio: Private, Robust, and Scalable Computation of Aggregate StatisticsPreprint
Corrigan-Gibbs, H., & Boneh, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.06255 · Cited by 200 · 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
Time-Optimal Interactive Proofs for Circuit Evaluation
Thaler, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40084-1_5 · Cited by 190 · see citing works
Decentralized Federated Learning: A Survey on Security and Privacy
Hallaji, E., Razavi‐Far, R., Saif, M., Wang, B., & Yang, Q. (2024) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2024.3362191 · Cited by 191 · see citing works
vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
Zhang, Y., Genkin, D., Katz, J. I., Papadopoulos, D., & Papamanthou, C. (2017) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2017.43 · Cited by 176 · see citing works
Verifying computations with state
Braun, B., Feldman, A. J., Ren, Z., Setty, S., Blumberg, A. J., & Walfish, M. (2013) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/2517349.2522733 · Cited by 168 · see citing works
Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof
Zhang, J., Xie, T., Zhang, Y., & Song, D. (2020) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40000.2020.00052 · Cited by 169 · see citing works
Identity Management Systems for the Internet of Things: A Survey Towards Blockchain Solutions
Zhu, X., & Badr, Y. (2018) · Sensors · doi:10.3390/s18124215 · Cited by 166 · see citing works
Verifying computations without reexecuting them
Walfish, M., & Blumberg, A. J. (2015) · Communications of the ACM · doi:10.1145/2641562 · Cited by 165 · see citing works
Xu, C. L., Zhang, C., Xu, J., & Pei, J. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3476249.3476283 · Cited by 164 · see citing works
How to Use Bitcoin to Incentivize Correct Computations
Kumaresan, R., & Bentov, I. (2014) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2660267.2660380 · Cited by 159 · see citing works
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs
Groth, J., Kohlweiss, M., Maller, M., Meiklejohn, S., & Miers, I. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_24 · Cited by 156 · see citing works
Decentralized Anonymous Credentials
Garman, C., Green, M., & Miers, I. (2014) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23253 · Cited by 156 · see citing works
Zero-knowledge using garbled circuits
Jawurek, M., Kerschbaum, F., & Orlandi, C. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516662 · Cited by 146 · see citing works
ShadowEth: Private Smart Contract on Public Blockchain
Yuan, R. H., Xia, Y., Chen, H., Zang, B., & Xie, J. (2018) · Journal of Computer Science and Technology · doi:10.1007/s11390-018-1839-y · Cited by 144 · see citing works
Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols
Aly, A., Ashur, T., Ben‐Sasson, E., Dhooghe, S., & Szepieniec, A. (2020) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2020.i3.1-45 · Cited by 143 · see citing works
A comprehensive survey on smart contract construction and execution: paradigms, tools, and systems
Hu, B., Zhang, Z., Liu, J., Liu, Y., Yin, J., Lu, R., & Lin, X. (2021) · Patterns · doi:10.1016/j.patter.2020.100179 · Cited by 149 · see citing works
A Hybrid Architecture for Interactive Verifiable Computation
Vu, V., Setty, S., Blumberg, A. J., & Walfish, M. (2013) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2013.48 · Cited by 140 · see citing works
BlockMaze: An Efficient Privacy-Preserving Account-Model Blockchain Based on zk-SNARKs
Guan, Z., Wan, Z., Yang, Y., Zhou, Y., & Huang, B. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.3025129 · Cited by 135 · see citing works
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs
Ben‐Sasson, E., Chiesa, A., Green, M., Tromer, E., & Virza, M. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.25 · Cited by 133 · see citing works
Efficient RAM and Control Flow in Verifiable Outsourced Computation
Wahby, R. S., Setty, S., Ren, Z., Blumberg, A. J., & Walfish, M. (2015) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23097 · Cited by 134 · see citing works
Zero-Knowledge Contingent Payments Revisited
Campanelli, M., Gennaro, R., Goldfeder, S., & Nizzardo, L. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3134060 · Cited by 133 · see citing works
ZKBoo: Faster Zero-Knowledge for Boolean CircuitsPreprint
Giacomelli, I., Madsen, J., & Orlandi, C. (2016) · IACR Cryptology ePrint Archive · Cited by 130 · see citing works
Taking proof-based verified computation a few steps closer to practicality
Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A. J., & Walfish, M. (2012) · Cited by 131 · see citing works
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs
Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., & Ishai, Y. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26954-8_3 · Cited by 130 · 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
Resolving the conflict between generality and plausibility in verified computation
Setty, S., Braun, B., Vu, V., Blumberg, A. J., Parno, B. J., & Walfish, M. (2013) · European Conference on Computer Systems · doi:10.1145/2465351.2465359 · Cited by 128 · see citing works
Self-citationSecure Two-Party Computation with Low Communication
Damgård, I., Faust, S., & Hazay, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_4 · Cited by 119 · see citing works
SafetyNets: Verifiable Execution of Deep Neural Networks on an Untrusted CloudPreprint
Ghodsi, Z., Gu, T., & Garg, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.10268 · Cited by 119 · see citing works
Bitansky, N., Canetti, R., Chiesa, A., Goldwasser, S., Lin, H., Rubinstein, A., & Tromer, E. (2016) · Journal of Cryptology · doi:10.1007/s00145-016-9241-9 · Cited by 116 · see citing works
Nonoutsourceable Scratch-Off Puzzles to Discourage Bitcoin Mining Coalitions
Miller, A. E., Kosba, A. E., Katz, J. I., & Shi, E. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813621 · Cited by 114 · see citing works
Accountable Privacy for Decentralized Anonymous Payments
Garman, C., Green, M., & Miers, I. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54970-4_5 · Cited by 113 · see citing works
Simple Key Enumeration (and Rank Estimation) Using Histograms: An Integrated Approach
Poussier, R., Standaert, F., & Grosso, V. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53140-2_4 · Cited by 109 · see citing works
VQL: Efficient and Verifiable Cloud Query Services for Blockchain Systems
Wu, H., Peng, Z., Guo, S., Yang, Y., & Xiao, B. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2021.3113873 · Cited by 109 · see citing works
Fog computing security and privacy for the Internet of Thing applications: State‐of‐the‐art
Alzoubi, Y. I., Osmanaj, V., Jaradat, A., & Al‐Ahmad, A. (2020) · Security and Privacy · doi:10.1002/spy2.145 · Cited by 108 · see citing works
vChain+: Optimizing Verifiable Blockchain Boolean Range Queries
Wang, H., Xu, C. L., Zhang, C., Xu, J., Peng, Z., & Pei, J. (2022) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00190 · Cited by 104 · see citing works
VeriML: Enabling Integrity Assurances and Fair Payments for Machine Learning as a Service
Zhao, L., Wang, Q., Wang, C., Li, Q. L., Shen, C. Q., & Feng, B. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2021.3068195 · 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
Xu, L., Shah, N., Chen, L., Diallo, N., Gao, Z., Lü, Y., & Shi, W. L. (2017) · doi:10.1145/3055518.3055527 · Cited by 100 · see citing works
Lipmaa, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42033-7_3 · Cited by 98 · see citing works
Wan, Z., & Deng, R. H. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2635128 · Cited by 98 · see citing works
Zhang, Y., Katz, J. I., & Papamanthou, C. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813711 · Cited by 97 · see citing works
XAuth: Efficient Privacy-Preserving Cross-Domain Authentication
Chen, J., Zhan, Z., He, K., Du, R., Wang, D., & Liu, F. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3092375 · Cited by 97 · see citing works
Danezis, G., Cédric Fournet, A., Kohlweiss, M., & Parno, B. J. (2013) · doi:10.1145/2517872.2517878 · Cited by 96 · see citing works
Self-citationxJsnark: A Framework for Efficient Verifiable Computation
Kosba, A. E., Papamanthou, C., & Shi, E. (2018) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2018.00018 · Cited by 96 · see citing works
Reconsidering big data security and privacy in cloud and mobile cloud systems
Tawalbeh, L., & Saldamlı, G. (2019) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2019.05.007 · Cited by 94 · see citing works
Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS
Golovnev, A., Lee, J. L. C., Setty, S., Thaler, J., & Wahby, R. S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38545-2_7 · Cited by 103 · see citing works
Efficient, Coercion-free and Universally Verifiable Blockchain-based Voting
Dimitriou, T. D. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107234 · Cited by 92 · see citing works
Authenticated Keyword Search in Scalable Hybrid-Storage Blockchains
Zhang, C., Xu, C. L., Wang, H., Xu, J., & Choi, B. K. K. (2021) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde51399.2021.00091 · Cited by 92 · see citing works
PipeZK: Accelerating Zero-Knowledge Proof with a Pipelined Architecture
Zhang, Y., Wang, S., Zhang, X., Dong, J., Mao, X., Long, F., Wang, C., Zhou, D., Gao, M., & Sun, G. (2021) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca52012.2021.00040 · Cited by 91 · see citing works
Evolution of Attacks, Threat Models, and Solutions for Virtualized Systems
Sgandurra, D., & Lupu, E. (2016) · ACM Computing Surveys · doi:10.1145/2856126 · Cited by 90 · see citing works
Non-Interactive Zero-Knowledge Proofs for Composite Statements
Agrawal, S., Ganesh, C., & Mohassel, P. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_22 · Cited by 90 · see citing works
ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data
Michael Backes, A., Barbosa, M., Fiore, D., & Reischuk, R. M. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.24 · Cited by 89 · see citing works
Circom: A Circuit Description Language for Building Zero-Knowledge Applications
Bellés-Muñoz, M., Isabel, M., Muñoz, J. L., Rubio, A., & Baylina, J. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2022.3232813 · Cited by 89 · see citing works
Proofs for Inner Pairing Products and Applications
Bünz, B., Maller, M., Mishra, P., Tyagi, N., & Vesely, P. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92078-4_3 · Cited by 88 · see citing works
Orion: Zero Knowledge Proof with Linear Prover Time
Xie, T., Zhang, Y., & Song, D. X. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-15985-5_11 · Cited by 88 · see citing works
Smart meter aggregation via secret-sharing
Danezis, G., Cédric Fournet, A., Kohlweiss, M., & Zanella-Béguelin, S. (2013) · doi:10.1145/2516930.2516944 · Cited by 88 · see citing works
Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge
Tramèr, F., Zhang, F., Lin, H., Hubaux, J., Juels, A., & Shi, E. (2017) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2017.28 · Cited by 88 · see citing works
Off-chaining Models and Approaches to Off-chain Computations
Eberhardt, J., & Heiss, J. (2018) · doi:10.1145/3284764.3284766 · Cited by 85 · see citing works
Enabling Secure and Efficient Decentralized Storage Auditing With Blockchain
Du, Y., Duan, H., Zhou, A., Wang, C., Au, M. H., & Wang, Q. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3081826 · Cited by 85 · see citing works
- Authors
- Parno, B., Howell, J., Gentry, C., & Raykova, M.
- Affiliations
- Microsoft (United States) (US)
- IBM (United States) (US)
- Venue
- 2013 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 238-252
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2018746447
- Cited by
- 864
- References
- 72
- Citations by year
- 2026: 40 · 2025: 44 · 2024: 68 · 2023: 70 · 2022: 101 · 2021: 95 · 2020: 82 · 2019: 68 · 2018: 54 · 2017: 52 · 2016: 55 · 2015: 51 · 2014: 54 · 2013: 25 · 2012: 5
- FWCI
- 39.83
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- IEEE Symposium on Security and Privacy (S&P) (publishedVersion)
- Funders
- National Science Foundation (1017660)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Physical Sciences › Computer Science › Artificial Intelligence › Security and Verification in Computing
- Keywords
- verifiable computation, outsourced computation, cloud computing, correctness proofs, cryptographic assumptions, verification efficiency, zero-knowledge proofs, Pinocchio
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
