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
Flagged first, then by citations
5 of the 72 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
Items 601–700 of 863
Enhancing Cryptocurrency Blocklisting: A Secure, Trustless, and Effective Realization
Du, Y., Zhou, A., & Wang, C. (2022) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs54860.2022.00112 · Cited by 3
Outsourcing Medical Dataset Analysis: A Possible Solution
Kaptchuk, G., Green, M., & Rubin, A. D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70972-7_6 · Cited by 3
An Efficient and Provably Secure Private Polynomial Evaluation Scheme
Xia, Z., Yang, B., Zhang, M., & Mu, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99807-7_38 · Cited by 3
Zhang, Y., Papamanthou, C., & Katz, J. I. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3233181 · Cited by 3
Multi-matrix verifiable computation
He, Y., & Zhang, L. F. (2020) · Cluster Computing · doi:10.1007/s10586-020-03116-z · Cited by 3
Privacy preserving event based transaction system in a decentralized environment
Karanjai, R., Xu, L., Gao, Z., Chen, L., Kaleem, M., & Shi, W. L. (2021) · International Middleware Conference · doi:10.1145/3464298.3493401 · Cited by 3
A Privacy-preserving Outsourcing Scheme for Zero-knowledge Proof Generation
Nakamura, M. M., Miyamae, T., & Morinaga, M. (2022) · Journal of Information Processing · doi:10.2197/ipsjjip.30.151 · Cited by 3
Info-Commit: Information-Theoretic Polynomial Commitment
Sahraei, S., Avestimehr, A. S., & Ali, R. E. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3163581 · Cited by 3
A Trusted Energy Data Sharing System Based on Blockchain
Bao, Y., Hao, M., Zhang, C., Yang, D., Fu, J., & Zhang, J. (2022) · Asia-Pacific Conference on Image Processing, Electronics and Computers (IPEC) · doi:10.1109/ipec54454.2022.9777322 · Cited by 3
Stateful Multi-client Verifiable Computation
Cachin, C., Ghosh, E., Papadopoulos, D., & Tackmann, B. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93387-0_33 · Cited by 3
SMTCoq: Mixing Automatic and Interactive Proof Technologies
Keller, C. (2019) · Mathematics education in the digital era · doi:10.1007/978-3-030-28483-1_4 · Cited by 3
Doubly-Efficient Pseudo-Deterministic ProofsPreprint
Goemans, M. X., Goldwasser, S., & Holden, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.00994 · Cited by 3
CIRCOM: A Robust and Scalable Language for Building Complex Zero-Knowledge CircuitsPreprint
Muñoz, J. L., Bellés, M., Isabel, M., Rubio, A., & Baylina, J. (2022) · doi:10.36227/techrxiv.19374986 · Cited by 3
Lin, L., Han, L., & Wang, L. (2025) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2025.110373 · Cited by 2
Vitārit: Paying for Threshold Services on Bitcoin and Friends
Thyagarajan, S. A. K., Mangipudi, E. V., Hanzlik, L., Kate, A., & Mukherjee, P. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00170 · Cited by 2
Automated Verification of Consistency in Zero-Knowledge Proof Circuits
Stephens, J., Pailoor, S., & Dillig, I. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-98668-0_16 · Cited by 2
Towards Scalable YOSO MPC via Packed Secret-Sharing
Escudero, D. E., Masserova, E., & Polychroniadou, A. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-5116-3_3 · Cited by 2
Zero Knowledge Proofs Enabling Ethical AI and Privacy-Preserving Verification in Distributed Systems
Khalid, L., Akhtar, M. U., Khalid, M., & Ahmed, I. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-6038-6.ch005 · Cited by 2
Transient Architectural Execution: From Weird Gates to Weird Programs
Wang, P.-L., Brown, F., Paccagnella, R., Ronen, E., Wahby, R. S., & Yarom, Y. (2026) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp63933.2026.00066 · Cited by 3
Computational Jurisprudence: Verifiable Law for Machine Societies
Stantchev, V. (2026) · Future Internet · doi:10.3390/fi18080437 · Cited by 3
Trusted computation with an adversarial cloud
Bopardikar, S. D., Alberto Speranzon, B., & Langbort, C. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7171099 · Cited by 2
Symbolic Malleable Zero-Knowledge Proofs
Michael Backes, A., Bendun, F., Maffei, M., Mohammadi, E., & Pecina, K. (2015) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2015.35 · Cited by 2
Verifying the correctness of remote executions
Walfish, M. (2013) · doi:10.1145/2524224.2524225 · Cited by 2
Jenifer, A. E., & Karthigaiveni, S. (2016) · International Journal of Applied Engineering Research · doi:10.37622/ijaer/11.3.2016.1894-1899 · Cited by 2
Integrity Checking for Aggregate Queries
Samarin, S. D., & Amini, M. (2021) · IEEE Access · doi:10.1109/access.2021.3079799 · Cited by 2
DBS: Blockchain-Based Privacy-Preserving RBAC in IoT
Li, X., Yang, J., Gao, S., Shi, Z., Li, J., & Fu, X. (2021) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-91424-0_6 · Cited by 2
A Lightweight Scalable Blockchain Architecture for IoT Devices
Yang, J., Xia, Q., Gao, J., Obiri, I. A., Sun, Y., & Yang, W. (2022) · International Conference on Electronics Technology (ICET) · doi:10.1109/icet55676.2022.9824814 · Cited by 2
Privacy Preserving Data Mining as Proof of Useful Work
Turesson, H., Kim, H., Laskowski, M., & Roatiş, A. (2022) · IGI Global eBooks · doi:10.4018/978-1-6684-7132-6.ch024 · Cited by 2
Efficient Cyber-Evidence Sharing Using Zero-Knowledge Proofs
Zand, A., & Pflüegel, E. (2023) · Springer proceedings in complexity · doi:10.1007/978-981-19-6414-5_13 · Cited by 2
SEVCOD: secure and efficient verifiable computation on outsourced data
Chakraborty, P. S., Gavhane, O. S., & Tripathy, S. (2023) · Cluster Computing · doi:10.1007/s10586-023-04190-9 · Cited by 2
Polynomial IOPs for Memory Consistency Checks in Zero-Knowledge Virtual Machines
Zhang, Y., Sun, S.-F., Zhang, R., & Gu, D. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8724-5_4 · Cited by 2
Simulation extractable SNARKs based on target linearly collision-resistant oracle
Wang, L., Li, Y., Zhang, S., Cai, D., & Kan, H. (2024) · Science China Technological Sciences · doi:10.1007/s11431-023-2580-5 · Cited by 2
On Efficient and Secure Compression Functions for Arithmetization-Oriented Hashing
Andreeva, E., Bhattacharyya, R., Roy, A., & Trevisani, S. (2024) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf61375.2024.00045 · Cited by 2
NOPE: Strengthening domain authentication with succinct proofs
DeStefano, Z., Jeff, J., Bonneau, J., & Walfish, M. (2024) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/3694715.3695962 · Cited by 3
Zero-Knowledge RAM: Doubly Efficient and Black-Box
Ishai, Y., Ostrovsky, R., & Shah, A. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91134-7_13 · Cited by 2
Revisiting Discrete Logarithm Reductions
Bollauf, M. F., Parisella, R., & Siim, J. (2025) · IACR Communications in Cryptology · doi:10.62056/a0c3c3c2h · Cited by 2
zk -Sherlock: Exposing Hardware Trojans in Zero-Knowledge
Mouris, D., Gouert, C., & Tsoutsos, N. G. (2022) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi54635.2022.00042 · Cited by 2
Xu, G., Amariucai, G. T., & Guan, Y. (2015) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2714576.2714631 · Cited by 2
Remote Testimony: How to Trust an Autonomous Vehicle
Alesiani, F., & Gajek, S. (2016) · IEEE Vehicular Technology Conference · doi:10.1109/vtcspring.2016.7504447 · Cited by 2
Delegating Biometric Authentication with the Sumcheck Protocol
Chabanne, H., Keuffer, J., & Lescuyer, R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45931-8_15 · Cited by 2
Verifiable outsourcing of constrained nonlinear programming by particle swarm optimization in cloud
Xiang, T., Zhang, W., Zhong, S., & Yang, J. (2017) · Soft Computing · doi:10.1007/s00500-017-2569-8 · Cited by 2
Trusted Computing with Addition Machines. I
Anisimov, A. V., & Novokshonov, A. (2017) · Cybernetics and Systems Analysis · doi:10.1007/s10559-017-9967-x · Cited by 2
Communication Efficient Checking of Big Data Operations
Hübschle-Schneider, L., & Sanders, P. (2018) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2018.00074 · Cited by 2
Function-Dependent Commitments for Verifiable Multi-party Computation
Schabhüser, L., Butin, D., Demirel, D., & Buchmann, J. A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99136-8_16 · Cited by 2
Efficient Fully-Leakage Resilient One-More Signature Schemes
Faonio, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12612-4_18 · Cited by 2
Countering Inside Threat Actors in Algorithm-Based Media
Smith, T. D. (2018) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2018.8621940 · Cited by 2
Fully Secure and Fast Signing from Obfuscation.
Ramchen, K., & Waters, B. R. (2014) · Cited by 2
Sealed computation: a mechanism to support privacy-aware trustworthy cloud service
Abdullah, L., & Quintero, J. (2019) · Information and Computer Security · doi:10.1108/ics-11-2018-0133 · Cited by 3
The Case of Adversarial Inputs for Secure Similarity Approximation Protocols
Kornaropoulos, E. M., & Efstathopoulos, P. (2019) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2019.00027 · Cited by 2
Idea: Towards an Inverted Cloud
Strackx, R., Philippaerts, P., & Vogels, F. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-15618-7_9 · Cited by 2
Public Verifiable Private Decision Tree Prediction
Wang, H., Deng, Y., & Xie, X. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-71852-7_16 · Cited by 2
Succinct Scriptable NIZK via Trusted Hardware
Zhang, B., Chen, Y., Li, J., Zhou, Y., Thai, P. D., Zhou, H.-S., & Ren, K. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88418-5_21 · Cited by 2
WiP: Privacy Enabled Biometric Authentication Based on Proof of Decryption Techniques
Syed, H., Shaik, I., Emmadi, N., Narumanchi, H., Thakur, M. S. D., & Bhattachar, R. M. A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92571-0_12 · Cited by 2
Coin Transfer Unlinkability Under the Counterparty Adversary Model
Miyamae, T., & Matsuura, K. (2022) · Ledger · doi:10.5195/ledger.2022.260 · Cited by 2
Non-Interactive Publicly-Verifiable Delegation of Committed Programs
Ghosal, R., Sahai, A., & Waters, B. R. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-31371-4_20 · Cited by 2
Evaluating Off-chain Transaction Queueing Delay to Ensure Data Integrity by Blockchain
Seike, H., Aoki, Y., & Koshizuka, N. (2023) · International Conference on Cloud Computing and Big Data Analytics (ICCCBDA) · doi:10.1109/icccbda56900.2023.10154727 · Cited by 2
Fides: A System for Verifiable Computation Using Smart Contracts
Nabi, M., Avizheh, S., & Safavi–Naini, R. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-32415-4_29 · Cited by 2
Blockchain Privacy and Self-Regulatory Compliance: Methods and Applications
Popov, V., Krupin, M., Gross, A., & Koreli, G. (2024) · International Journal of Cryptocurrency Research · doi:10.51483/ijccr.4.1.2024.64-78 · Cited by 2
IZPR: Instant Zero Knowledge Proof of Reserve
Conley, T., Díaz, N. C., Espada, D., Kuruvilla, A., Mayne, S., & Fu, X. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-69231-4_15 · Cited by 2
Shorter arithmetization of nondeterministic computations
Chiesa, A., & Allen-Zhu, Z. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.07.030 · Cited by 2
ClearChart: Ensuring integrity of consumer ratings in online marketplaces
Moreno-Sánchez, P., Mahmood, U., & Kate, A. (2018) · Computers & Security · doi:10.1016/j.cose.2018.04.014 · Cited by 2
Online Advertising with Verifiable Fairness
Huang, C., Ni, J., Lu, R., & Shen, X. (2019) · International Conference on Communications · doi:10.1109/icc.2019.8761762 · Cited by 2
Efficient HW/SW partitioning of Halo: FPGA-accelerated recursive proof composition in blockchain
Akeela, R., & Krawiec‐Thayer, M. P. (2021) · Microsystem Technologies · doi:10.1007/s00542-020-05138-4 · Cited by 4
PvCT: A Publicly Verifiable Contact Tracing Algorithm in Cloud Computing
Zhu, Y., Ma, W., Cui, J., Xia, X., Peng, Y., & Ning, J. (2021) · Security and Communication Networks · doi:10.1155/2021/5514137 · Cited by 2
Updatable NIZKs from Non-Interactive Zaps
Baghery, K., & Bardeh, N. G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20974-1_2 · Cited by 2
Blockchain for Security of a Cloud-based Online Auction System
Shu, Y. (2018) · Tuwhera (Auckland University of Technology) · Cited by 2
Compact Multiparty Verification of Simple ComputationsPreprint
Ross, O., & Jensen, J. R. (2018) · SSRN Electronic Journal · doi:10.2139/ssrn.3745627 · Cited by 2
InfoCommit: Information-Theoretic Polynomial Commitment and VerificationPreprint
Sahraei, S., & Avestimehr, S. (2020) · arXiv (Cornell University) · Cited by 2
Turesson, H., Kim, H., Laskowski, M., & Roatiş, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.08744 · Cited by 2
Darlin: Recursive Proofs using MarlinPreprint
Haböck, U., Garoffolo, A., & Di Benedetto, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.04315 · Cited by 2
Post‐Quantum Confidential Transaction Protocols
Devi, R. M., Keerthika, P., Suresh, P., Venkatesan, R., Sangeetha, M., Sagana, C., & Devendran, K. (2022) · doi:10.1002/9781119836728.ch8 · Cited by 2
Invoice factoring through blockchain technology
Mohammadzadeh, N. (2022) · doi:10.5821/dissertation-2117-384523 · Cited by 2
Fully homomorphic encryption for machine learning
Minelli, M. (2018) · theses.fr (ABES) · doi:10.70675/0ac594f8z13c6z4939za1e6z699263c030ad · Cited by 15
Comparison Experimental Analysis of Different Cryptocurrencies
Fu, D., Hu, H., Xu, Y., & Zheng, K. (2022) · International Conference on Big Data, Information and Computer Network (BDICN) · doi:10.1109/bdicn55575.2022.00070 · Cited by 1
Verification of Deep Neural Networks with KGZ-Based zkSNARK
Thakur, S., & Breslin, J. G. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-66336-9_6 · Cited by 1
Secure Coalition Formation for Federated Machine Learning
Thakur, S., & Breslin, J. G. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-66694-0_15 · Cited by 1
Formal Verification of the Sumcheck Protocol
Bosshard, A. G., Bootle, J., & Sprenger, C. (2024) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf61375.2024.00014 · Cited by 1
Trustworthy Distributed Certification of Program Execution
Wolf, A., Palma, M. E., Salza, P., & Gall, H. C. (2025) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2025.3541810 · Cited by 1
SAVER: SNARK-Compatible Verifiable Encryption
Lee, J., Choi, J.-K., Kim, J., & Oh, H. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-78679-2_11 · Cited by 1
Split Prover Zero-Knowledge SNARKs
Garg, S., Goel, A., Kolonelos, D., Shiehian, S., & Sinha, R. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91820-9_12 · Cited by 1
Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs
Ozdemir, A., Laufer, E., & Boneh, D. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00054 · Cited by 1
Oechsner, S., Pereira, V., & Schöll, P. (2025) · IACR Communications in Cryptology · doi:10.62056/a0wa0lmol · Cited by 1
Lightweight Transparent Zero-Knowledge Proofs for Cross-Domain Statements
Tu, Z., Xie, M., Fang, J., Yu, Y. T., & Jiang, Z. L. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-3540-8_3 · Cited by 1
A Survey on Off-chain Technologies
Shi, C., Xie, H., Yan, Z., & Yang, L. T. (2025) · ACM Computing Surveys · doi:10.1145/3765897 · Cited by 3
Polylogarithmic Polynomial Commitment Scheme over Galois Rings
Zhuo, W. U., Zhang, X., Deng, Y., Wei, Y., Zhang, Z., & Yang, L. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-07891-9_21 · Cited by 1
Rapidash: Atomic Swaps Secure Under User-Miner Collusion
Chung, H., Masserova, E., Shi, E., & Thyagarajan, S. A. K. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-07024-1_15 · Cited by 1
Nitulescu, A., Paslis, N., & Ràfols, C. (2026) · IACR Communications in Cryptology · doi:10.62056/ayc3tx4e- · Cited by 1
Security-Performance Optimization in Cloud-Based Bank Data Processing Using HE-ZKP-ORAM
Kim, T. N., & Pham, N. M. N. (2026) · Engineering Technology & Applied Science Research · doi:10.48084/etasr.16654 · Cited by 1
Soloist: Distributed SNARK for R1CS with Constant Proof Size
Li, W., Zhang, Z., Li, Y., Zhu, P., Hong, C., & Liu, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-25336-1_3 · Cited by 1
Siim, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-26734-4_15 · Cited by 1
Secure Distributed Computing on a Manycore Cloud
Lombardi, F. (2014) · Cited by 1
Takashima, K. (2015) · Cited by 1
Cryptographic Tools for Cloud Environments
Alderman, J., Crampton, J., & Martin, K. M. (2015) · Computer communications and networks · doi:10.1007/978-3-319-25988-8_2 · Cited by 1
Faster Zero-Knowledge Protocols and Applications
Orlandi, C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69284-5_1 · Cited by 1
Verifiable outsourced computation integrity in cloud-assisted big data processing
Bouleghlimat, I., & Hacini, S. (2018) · International Symposium on Programming and Systems (ISPS) · doi:10.1109/isps.2018.8379019 · Cited by 1
Authenticated LSM Trees with Minimal Trust
Tang, Y., Li, K., & Ju, C. A. (2019) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-37231-6_27 · Cited by 1
Pisces: A New Zero-Knowledge Protocol for Blockchain Privacy
Fu, S., & Gong, G. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-70881-8_12 · Cited by 1
Avizheh, S., Haffey, P., & Safavi–Naini, R. (2021) · Cloud Computing Security Workshop · doi:10.1145/3474123.3486756 · Cited by 1
Efficient verifiable computation over quotient polynomial rings
Park, J. H., Cheon, J. H., & Kim, D. (2022) · International Journal of Information Security · doi:10.1007/s10207-022-00590-x · Cited by 1
Efficient Verifiable Boolean Range Query for Light Clients on Blockchain Database
Gong, J., Wu, J., Wang, J., & Tan, S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-16815-4_2 · Cited by 1
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
