The DOI matches its Crossref record; 67 of the 72 references it cites were found in a registry or an index.
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.
Overview
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
Verification
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?
The cited source says what the claim attributes to it.
In the citing paper
“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]
The cited source says what the claim attributes to it.
In the citing paper
“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]
In the citing paper
“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.
Citations
Cites
Adomavičius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,539
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
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,098
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,540
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
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
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,341
Self-citationLattice Gas Cellular Automata and Lattice Boltzmann Models
Wolf-Gladrow, D. A. (2000) · Lecture notes in mathematics · doi:10.1007/b72010 · Cited by 1,623
Proof 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
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
Cited by
Sorted by citations
Items 701–800 of 863
Resumable Zero-Knowledge for Circuits from Symmetric Key Primitives
Zhang, H., Wei, P., Xue, H., Deng, Y., Li, J., Wang, W., & Liu, G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22301-3_19 · Cited by 1
A Universally Composable Non-interactive Aggregate Cash System
Jia, Y., Shi-Feng, S., Zhou, H.-S., & Gu, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22963-3_25 · 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
zk-SNARKs from Codes with Rank Metrics
Do, X.-T., Mac, D.-T., & Vu, Q.-H. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-47818-5_6 · 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
SNARKProbe: An Automated Security Analysis Framework for zkSNARK Implementations
Fan, Y., Xu, Y., & Garman, C. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-54773-7_14 · Cited by 1
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting
Dutta, M., Ganesh, C., & Jawalkar, N. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-57722-2_10 · Cited by 1
Privacy-Preserving Control of Partitioned Energy Resources
Laufer, E., Levis, P. A., & Rajagopal, R. (2024) · ACM International Conference on Future Energy Systems (e-Energy) · doi:10.1145/3632775.3661988 · Cited by 1
Towards zero knowledge argument for double discrete logarithm with constant cost
Krishnan, D., & Fu, X. (2024) · Theoretical Computer Science · doi:10.1016/j.tcs.2024.114799 · 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
Meng, L., Xu, Y., Xu, H., Zhou, X., & Han, Z. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3568796 · Cited by 1
Fast Proof Generation for Verifying Cloud Search
Zhou, J., Cao, J., Yao, B., & Guo, M. (2015) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2015.11 · Cited by 1
Kreuter, B., & Shelat, A. A. (2013) · doi:10.1145/2517872.2517877 · Cited by 1
Analysis of the State of the Art
Demirel, D., Schabhüser, L., & Buchmann, J. A. (2017) · SpringerBriefs in computer science · doi:10.1007/978-3-319-53798-6_8 · Cited by 1
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 1
Cryptanalysis of Morillo–Obrador polynomial delegation schemes
Xu, S., & Zhang, L. F. (2017) · IET Information Security · doi:10.1049/iet-ifs.2017.0259 · Cited by 1
Secure and trusted partial grey-box verification
Cai, Y., Karakostas, G., & Wassyng, A. (2019) · International Journal of Information Security · doi:10.1007/s10207-019-00431-4 · Cited by 1
On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups
Kraiem, F., Isobe, S., Koizumi, E., & Shizuya, H. (2019) · Interdisciplinary Information Sciences · doi:10.4036/iis.2019.r.03 · Cited by 1
Privc: Privacy Preserving Verifiable Computation
Gajera, H., & Das, M. L. (2020) · International Conference on Communication Systems & Networks (COMSNETS) · doi:10.1109/comsnets48256.2020.9027488 · Cited by 1
Mining for Privacy: How to Bootstrap a Snarky Blockchain
Kerber, T., Kiayias, A., & Kohlweiss, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-662-64322-8_24 · Cited by 1
Sidhu, H. J. S., & Khanna, M. S. (2020) · International Conference on Parallel, Distributed and Grid Computing (PDGC) · doi:10.1109/pdgc50313.2020.9315808 · Cited by 1
An Efficient HPRA-Based Multiclient Verifiable Computation: Transform and Instantiation
Xu, S. (2021) · Security and Communication Networks · doi:10.1155/2021/6612614 · Cited by 1
Security of the Poseidon Hash Function Against Non-Binary Differential and Linear Attacks
Kovalchuk, L., Oliynykov, R., & Rodinko, M. (2021) · Cybernetics and Systems Analysis · doi:10.1007/s10559-021-00352-y · Cited by 1
Towards Smart Contracts for Verifying DNN Model Generation Process with the Blockchain
Seike, H., Aoki, Y., & Koshizuka, N. (2021) · IEEE International Conference on Big Data Analytics (ICBDA) · doi:10.1109/icbda51983.2021.9403138 · Cited by 1
Batching Anonymous and Non-Anonymous Membership Proofs for Blockchain Applications
Fu, S., Luo, G., & Gong, G. (2021) · IEEE World AI IoT Congress (AIIoT) · doi:10.1109/aiiot52608.2021.9454223 · Cited by 1
Trusted Computing with Addition Machines. II*
Anisimov, A. V., & Novokshonov, A. (2018) · Cybernetics and Systems Analysis · doi:10.1007/s10559-018-0002-7 · Cited by 1
Enabling Efficient and Secure Outsourcing of Large Matrix Multiplications
Jia, K., Li, H., Liu, D., & Yu, S. (2014) · Globecom · doi:10.1109/glocom.2014.7417184 · Cited by 1
A practical validation of Homomorphic Message Authentication schemes
de Carvalho, N. T. F. (2014) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · Cited by 1
Cryptographic Tools for the Cloud
Gorbunov, S. (2015) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Accountability in Cloud Computing and Distributed Computer Systems
Xiao, H. (2014) · Cited by 1
On deploying succinct zero-knowledge proofs
Virza, M. (2017) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
KeyForge: Mitigating Email Breaches with Forward-Forgeable SignaturesPreprint
Specter, M. A., Park, S., & Green, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.06425 · Cited by 1
Authenticated Key-Value Stores with Hardware EnclavesPreprint
Tang, Y., Ju, C. A., Li, K., Xu, J., & Zhang, Q. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.12068 · Cited by 1
Dumas, J., Kaltofen, E., Thomé, E., & Villard, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.00810 · Cited by 1
Practical Verification of MapReduce Computation Integrity via Partial Re-executionPreprint
Yoon, E., & Liu, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.09560 · Cited by 1
Petersen, E., Potdevin, Y., Mohammadi, E., Zidowitz, S., Breyer, S., Nowotka, D., Henn, S., Pechmann, L., Leucker, M., Rostalski, P., et al. (2021) · arXiv (Cornell University) · Cited by 1
Scalable Zero Knowledge via Cycles of Elliptic Curves.Preprint
Ben‐Sasson, E., Chiesa, A., Tromer, E., & Virza, M. (2014) · IACR Cryptology ePrint Archive · Cited by 1
Edge Computing, Fog and MIST Architecture Analysis, Application, and Challenges
Makiabadi, M. K. (2021) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3-33sn-3a20 · Cited by 1
Distributed Cryptographic Protocols
Flor, A. M. L. (2023) · doi:10.4995/thesis/10251/198106 · Cited by 1
Dumas, J., Kaltofen, E., & Thomé, E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.01083 · Cited by 1
Secure and Trusted Verification
Cai, Y. (2015) · MacSphere (McMaster University) · doi:10.71548/21323
Delegation of Computation with Verification Outsourcing Using GENI Infrastructure
Xu, G., Amariucai, G. T., & Guan, Y. (2014) · GENI Research and Educational Experiment Workshop (GREE) · doi:10.1109/gree.2014.16
Integrity, Consistency, and Verification of Remote Computation
Cachin, C. (2014) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2660267.2660575
Trusted, Heterogeneous, and Autonomic Mobile Cloud
Lombardi, F., & Pietro, R. D. (2015) · Springer eBooks · doi:10.1007/978-3-319-14971-4_14
Cryptography for Big Data Security Book Chapter for Big Data: Storage, Sharing, and Security (3S)
Hamlin, A., Schear, N., Shen, E., Varia, M., Yakoubov, S., & Yerukhimovich, A. (2016)
Generic Construction of Publicly Verifiable Predicate Encryption
Tan, C., Jiang, Z. L., Wang, X., Yiu, S., Fang, J., Li, J., Jin, Y., & Huang, J. (2016) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2897845.2897919
Safe enclosures: towards cryptographic techniques for server protection.
Bursuc, S., & Murphy, J. P. (2013)
Study of a Verifiable Biometric Matching
Chabanne, H., Keuffer, J., & Lescuyer, R. (2016) · ACM Workshop on Information Hiding and Multimedia Security (IH&MMSec) · doi:10.1145/2909827.2931097
Improved algorithm for secure outsourcing of modular exponentiations with high checkability
Ye, J., Chen, X., & Ma, J. (2016) · International Journal of Ad Hoc and Ubiquitous Computing · doi:10.1504/ijahuc.2016.079260
A Verifiable System for Automated Face Identification
Chabanne, H., Keuffer, J., & Lescuyer, R. (2016) · International Conference of the Biometrics Special Interest Group (BIOSIG) · doi:10.1109/biosig.2016.7736907
An efficient instance hiding scheme
Malluhi, Q. M., Shikfa, A., & Trinh, V. C. (2016) · International Symposium on Information and Communication Technology · doi:10.1145/3011077.3011100
Vemaque: Approximately verifiable remote computation of k-clique and maximum clique problems
Samarawickrama, R. G. L. M., Ranasinghe, D. N., & Sritharan, T. (2016) · International Conference on Advances in ICT for Emerging Regions · doi:10.1109/icter.2016.7829909
The Research on Video Security Carving Using Secure Outsourcing Approach
Xu, Z., Sun, G., & Ding, Y. (2017) · Lecture notes in electrical engineering · doi:10.1007/978-981-10-3187-8_4
Public delegation & verifiability of matrix multiplication to a malicious cloud server
Kumar, M., Meena, J., Vardhan, M., & Jain, S. (2016) · IEEE Power India International Conference · doi:10.1109/poweri.2016.8077371
Verifiable Outsourcing of Computations Using Garbled Onions
Dönmez, T. C. M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01141-3_8
Revisiting Yasuda et al.’s Biometric Authentication Protocol: Are You Private Enough?
Pagnin, E., Liu, J., & Mitrokotsa, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-02641-7_8
Outsourcing Signatures of Confidential Documents
Chabanne, H., Keuffer, J., & Prouff, E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12143-3_4
How to Vote Privately Using Bitcoin.
Zhao, Z., & Chan, T.-H. H. (2015)
Verifiable Computation in Multiparty Protocols with Honest Majority
Pankova, A., & Laud, P. (2015) · IOS Press eBooks · doi:10.3233/978-1-61499-532-6-165
Efficient 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)
Verifiable Delegation of Computation on Outsourced Data.
Michael Backes, A., Fiore, D., & Reischuk, R. M. (2013)
Incentivized Outsourced Computation Resistant to Malicious Contractors.Preprint
Küpçü, A. (2014) · IACR Cryptology ePrint Archive
Efficient Outsourcing of Modular Exponentiations in Cloud Computing
Ye, J., Tang, B., & Wang, Z. (2019) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-25128-4_181
Proof of All: Verifiable Computation in a NutshellPreprint
Barbara, M. A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.02327 · Cited by 1
SafeComp: Protocol for Certifying Cloud Computations Integrity
Shishkin, E. A., & Kislitsyn, E. V. (2021) · Programming and Computer Software · doi:10.1134/s0361768821080053
Demystifying incentives in the consensus computer.
Luu, L., Teutsch, J., Kulkarni, R., & Saxena, P. (2015)
Privacy-Preserving Credit Scoring Using Zero-Knowledge Proofs
Park, C., Kim, J., & Lee, D. H. (2019) · Information Security and Cryptology · doi:10.13089/jkiisc.2019.29.6.1285
Protocol for Certifying Cloud Computations Integrity
Shishkin, E., & Kislitsyn, E. (2020) · Proceedings of the Institute for System Programming of RAS · doi:10.15514/ispras-2020-32(4)-8
On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question
Kraiem, F., Isobe, S., Koizumi, E., & Shizuya, H. (2020) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2020cip0002
Trinocchio: Privacy-Preserving Outsourcing By Distributed Verifiable Computation
Schoenmakers, B., Veeningen, M., & de Vreede, N. (2016) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.60294
ZERO-KNOWLEDGE PROOF OF KNOWLEDGE OF MULTIVARIATE POLYNOMIAL’S ZERO
Siriak, A. V., & Turchyna, V. A. (2020) · Problems of applied mathematics and mathematic modeling · doi:10.15421/322015
Composition with Knowledge Assumptions
Kerber, T., Kiayias, A., & Kohlweiss, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84259-8_13
Investment Compliance in Hedge Funds using Zero Knowledge Proofs
Kalra, K. (2021) · The Journal of British Blockchain Association · doi:10.31585/jbba-4-1-(9)2021
THC: Practical and Cost-Effective Verification of Delegated Computation
Rauzy, P., & Nehme, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92548-2_27
Ferproof: A Constant Cost Range Proof Suitable for Floating-Point Numbers
Li, Y., Zhou, K., Xu, L., Wang, M., & Liu, N. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-95391-1_41
Scriptable and composable SNARKs in the trusted hardware model1
Zhou, Z., Zhang, B., Chen, Y., Li, J., Zhou, Y., Lu, Y., Ren, K., Thai, P. D., & Zhou, H.-S. (2022) · Journal of Computer Security · doi:10.3233/jcs-210167
Cryptographic Mechanisms that Ensure the Efficiency of SNARK-Systems
Kovalchuk, L., Oliynykov, R., Bespalov, Y., & Rodinko, M. (2022) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-030-95161-0_8
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
Demirel, D., Schabhüser, L., & Buchmann, J. A. (2017) · SpringerBriefs in computer science · doi:10.1007/978-3-319-53798-6_9
Xu, C. L., Zhang, C., & Xu, J. (2019) · Springer eBooks · doi:10.1007/978-3-319-32903-1_299-1
Xu, C. L., Zhang, C., & Xu, J. (2020) · Springer eBooks · doi:10.1007/978-3-319-78262-1_299
Fpswap: Fair and Privacy Friendly Swap of Digital Assets on BlockchainPreprint
Karanjai, R., Xu, L., Gao, Z., Chen, L., Kasichainula, K., Cărbunar, B., & Shi, W. L. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4141949
Walunj, V. S., Gupta, P. K., & Parvat, T. J. (2023) · Lecture notes in networks and systems · doi:10.1007/978-981-99-1745-7_64
An Efficient Range Proof Based on Polynomial Commitment and Vector Inner Product CommitmentPreprint
You, L., Guo, C., & Hu, G. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4525586
Security Technologies to Improve Content-Distribution and Broadcasting Services
Ogawa, K. (2023) · IEICE ESS FUNDAMENTALS REVIEW · doi:10.1587/essfr.17.2_108
Exploration of Algorithms for the Hardware Acceleration of Multi-Scalar Multiplication on FPGA
Cilliers, S., & Mishra, A. K. (2023) · International Conference on Emerging Trends in Networks and Computer Communications (ETNCC) · doi:10.1109/etncc59188.2023.10284978
Yang, Y., & Song, G. (2023) · Information · doi:10.3390/info14110603
Reliable Data Provenance in HCN
Liu, D., & Shen, X. (2023) · Wireless networks · doi:10.1007/978-3-031-52477-6_3
Fundamental Data Security Technologies
Liu, D., & Shen, X. (2023) · Wireless networks · doi:10.1007/978-3-031-52477-6_2
Liu, D., & Shen, X. (2023) · Wireless networks · doi:10.1007/978-3-031-52477-6_4
Private Verification in Multi-stakeholder Environment and its Application to Stable Matching
Nakamura, T., Okada, H., Fukushima, K., & Isohara, T. (2024) · SN Computer Science · doi:10.1007/s42979-024-02631-9
Humanode: The First Crypto-Biometric Network
Kavazi, D., Smirnov, V., Shilina, S., Shomroni, J., Contreras, R., Gajera, H., & Lavrenov, D. (2023) · Asia Service Sciences and Software Engineering Conference (ASSE) · doi:10.1145/3634814.3634843
A Sealed-Bid Auction with Fund Binding: Preventing Maximum Bidding Price Leakage
Chin, K., Emura, K., Sato, S., & Omote, K. (2024) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2023dap0002
SECURED PAYMENT ON BLOCKCHAIN FOR OUTSOURCING SERVICES IN CLOUD COMPUTING
Guru Nanak Institutions Technical Campus, H., & Sutrawe, M. R. (2024) · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · doi:10.55041/ijsrem33970
Metadata
- 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
- 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 › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Physical Sciences › Computer Science › Hardware and Architecture › 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
