On the public citation graph
Delegating Computation
0 signed · 291 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-34805-0_13openalex-snapshot
Bit Commitment Using Pseudo-Randomness
inferredcites →https://doi.org/10.1007/11556992_23openalex-snapshot
An Oblivious Transfer Protocol with Log-Squared Communication
inferredcites →https://doi.org/10.1007/3-540-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1007/3-540-48910-x_28openalex-snapshot
Computationally Private Information Retrieval with Polylogarithmic Communication
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_6openalex-snapshot
On Cryptographic Assumptions and Challenges
inferredcites →https://doi.org/10.1007/978-3-540-70936-7_31openalex-snapshot
Evaluating Branching Programs on Encrypted Data
inferredcites →https://doi.org/10.1007/978-3-642-03356-8_9openalex-snapshot
Probabilistically Checkable Arguments
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_14openalex-snapshot
From Secrecy to Soundness: Efficient Verification via Secure Computation
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_25openalex-snapshot
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_26openalex-snapshot
Improved Delegation of Computation Using Fully Homomorphic Encryption
inferredcites →https://doi.org/10.1007/978-3-642-17373-8_19openalex-snapshot
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
inferredcites →https://doi.org/10.1007/978-3-642-28914-9_10openalex-snapshot
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
inferredcites →https://doi.org/10.1007/978-3-642-28914-9_24openalex-snapshot
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
inferredcites →https://doi.org/10.1007/978-3-642-28914-9_4openalex-snapshot
Secure Two-Party Computation with Low Communication
inferredcites →https://doi.org/10.1007/978-3-642-38348-9_37openalex-snapshot
Quadratic Span Programs and Succinct NIZKs without PCPs
inferredcites →https://doi.org/10.1007/978-3-642-40084-1_5openalex-snapshot
Time-Optimal Interactive Proofs for Circuit Evaluation
inferredcites →https://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferredcites →https://doi.org/10.1007/bf01200430openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/s00037-016-0136-9openalex-snapshot
Non-interactive proofs of proximity
inferredcites →https://doi.org/10.1016/0022-0000(88)90038-4openalex-snapshot
Probabilistic game automata
inferredcites →https://doi.org/10.1016/0304-3975(93)90210-kopenalex-snapshot
Interactive proof systems and alternating time—space complexity
inferredcites →https://doi.org/10.1109/ccc.2002.1004355openalex-snapshot
Universal Arguments and their Applications
inferredcites →https://doi.org/10.1109/ccc.2009.40openalex-snapshot
Are PCPs Inherent in Efficient Arguments?
inferredcites →https://doi.org/10.1109/focs.2006.74openalex-snapshot
Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP
inferredcites →https://doi.org/10.1109/focs.2011.12openalex-snapshot
Efficient Fully Homomorphic Encryption from (Standard) LWE
inferredcites →https://doi.org/10.1109/grid.2004.14openalex-snapshot
BOINC: A System for Public-Resource Computing and Storage
inferredcites →https://doi.org/10.1109/sfcs.1988.21918openalex-snapshot
Zero-knowledge with log-space verifiers
inferredcites →https://doi.org/10.1109/sfcs.1989.63519openalex-snapshot
On the complexity of space bounded interactive proofs
inferredcites →https://doi.org/10.1109/sfcs.1991.185343openalex-snapshot
Languages that are easier than their proofs
inferredcites →https://doi.org/10.1109/sfcs.1997.646125openalex-snapshot
Replication is not needed: single database, computationally-private information retrieval
inferredcites →https://doi.org/10.1109/sfcs.2003.1238185openalex-snapshot
On the (In)security of the Fiat-Shamir paradigm
inferredcites →https://doi.org/10.1109/sp.2013.48openalex-snapshot
A Hybrid Architecture for Interactive Verifiable Computation
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/060656838openalex-snapshot
Sub-Constant Error Low Degree Test of Almost-Linear Size
inferredcites →https://doi.org/10.1137/s0097539705446810openalex-snapshot
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
inferredcites →https://doi.org/10.1137/s0097539705446962openalex-snapshot
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1142/11060openalex-snapshot
Proceedings of the International Congress of Mathematicians (ICM 2018)
inferredcites →https://doi.org/10.1145/1008731.1008734openalex-snapshot
The random oracle methodology, revisited
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/103516.128681openalex-snapshot
Space-bounded probabilistic game automata
inferredcites →https://doi.org/10.1145/1132516.1132553openalex-snapshot
The PCP theorem by gap amplification
inferredcites →https://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferredcites →https://doi.org/10.1145/1250790.1250794openalex-snapshot
Zero-knowledge from secure multiparty computation
inferredcites →https://doi.org/10.1145/1250790.1250855openalex-snapshot
Verifying and decoding in constant depth
inferredcites →https://doi.org/10.1145/129712.129782openalex-snapshot
A note on efficient zero-knowledge proofs and arguments (extended abstract)
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/1536414.1536440openalex-snapshot
Fully homomorphic encryption using ideal lattices
inferredcites →https://doi.org/10.1145/174130.174138openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
inferredcites →https://doi.org/10.1145/195058.195132openalex-snapshot
Nearly-linear size holographic proofs
inferredcites →https://doi.org/10.1145/1993636.1993651openalex-snapshot
Separating succinct non-interactive arguments from all falsifiable assumptions
inferredcites →https://doi.org/10.1145/200836.200880openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.1145/2090236.2090245openalex-snapshot
Practical verified computation with streaming interactive proofs
inferredcites →https://doi.org/10.1145/2090236.2090263openalex-snapshot
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/2488608.2488623openalex-snapshot
Recursive composition and bootstrapping for SNARKS and proof-carrying data
inferredcites →https://doi.org/10.1145/2488608.2488709openalex-snapshot
Interactive proofs of proximity
inferredcites →https://doi.org/10.1145/258533.258635openalex-snapshot
Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments
inferredcites →https://doi.org/10.1145/258533.258644openalex-snapshot
Making games short (extended abstract)
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/509907.509958openalex-snapshot
2-round zero knowledge and proof auditors
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_4openalex-snapshot
Aurora: Transparent Succinct Arguments for R1CS
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_24openalex-snapshot
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_3openalex-snapshot
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs
inferred← citeshttps://doi.org/10.1007/978-3-030-30952-7_20openalex-snapshot
Research of Query Verification Algorithm on Body Sensing Data in Cloud Computing Environment
inferred← citeshttps://doi.org/10.1007/978-3-030-35389-6_19openalex-snapshot
Outsourcing Computation: The Minimal Refereed Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-030-36033-7_1openalex-snapshot
Succinct Arguments in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_18openalex-snapshot
Constant-Round Interactive Proof Systems for AC0[2] and NC1
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_4openalex-snapshot
Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_25openalex-snapshot
SPARKs: Succinct Parallelizable Arguments of Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_26openalex-snapshot
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_27openalex-snapshot
Fractal: Post-quantum and Transparent Recursive Proofs from Holography
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_19openalex-snapshot
Round-Optimal Black-Box Commit-and-Prove with Succinct Communication
inferred← citeshttps://doi.org/10.1007/978-3-030-57808-4_3openalex-snapshot
Secure and Efficient Delegation of Elliptic-Curve Pairing
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_7openalex-snapshot
Classical Verification of Quantum Computations with Efficient Verifier
inferred← citeshttps://doi.org/10.1007/978-3-030-88418-5_21openalex-snapshot
Succinct Scriptable NIZK via Trusted Hardware
inferred← citeshttps://doi.org/10.1007/978-3-030-88428-4_31openalex-snapshot
Zero Knowledge Contingent Payments for Trained Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-93944-1_16openalex-snapshot
Smart Contracts for Incentivized Outsourcing of Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-99191-3_6openalex-snapshot
Optimizing Fund Allocation for Game-Based Verifiable Computation Outsourcing
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_18openalex-snapshot
SNARGs for P from Sub-exponential DDH and QR
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_16openalex-snapshot
Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_18openalex-snapshot
Succinct Interactive Oracle Proofs: Applications and Limitations
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_18openalex-snapshot
Doubly Efficient Interactive Proofs over Infinite and Non-commutative Rings
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_22openalex-snapshot
Parallelizable Delegation from LWE
inferred← citeshttps://doi.org/10.1007/978-3-031-31371-4_20openalex-snapshot
Non-Interactive Publicly-Verifiable Delegation of Committed Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-38100-3_1openalex-snapshot
Energy Complexity of Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_1openalex-snapshot
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-48621-0_12openalex-snapshot
Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-3-031-48774-3_5openalex-snapshot
Payable Outsourced Decryption for Functional Encryption Using BlockChain
inferred← citeshttps://doi.org/10.1007/978-3-031-52477-6_2openalex-snapshot
Fundamental Data Security Technologies
inferred← citeshttps://doi.org/10.1007/978-3-031-68376-3_1openalex-snapshot
Loquat: A SNARK-Friendly Post-quantum Signature Based on the Legendre PRF with Applications in Ring and Aggregate Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-68403-6_4openalex-snapshot
Zero-Knowledge IOPs Approaching Witness Length
inferred← citeshttps://doi.org/10.1007/978-3-031-68403-6_5openalex-snapshot
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-70890-9_10openalex-snapshot
Confidential and Verifiable Machine Learning Delegations on the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-031-78011-0_11openalex-snapshot
Rate-1 Zero-Knowledge Proofs from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-78017-2_13openalex-snapshot
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-031-91134-7_13openalex-snapshot
Zero-Knowledge RAM: Doubly Efficient and Black-Box
inferred← citeshttps://doi.org/10.1007/978-3-031-91134-7_4openalex-snapshot
Succinct Arguments over Towers of Binary Fields
inferred← citeshttps://doi.org/10.1007/978-3-031-91134-7_5openalex-snapshot
Blaze: Fast SNARKs from Interleaved RAA Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_1openalex-snapshot
How to Prove False Statements: Practical Attacks on Fiat-Shamir
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_2openalex-snapshot
Towards a White-Box Secure Fiat-Shamir Transformation
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_18openalex-snapshot
Zero-Knowledge in Streaming Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_21openalex-snapshot
Verifiable Computation for Approximate Homomorphic Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_2openalex-snapshot
Time-Space Trade-Offs for Sumcheck
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_5openalex-snapshot
Jagged Polynomial Commitments (or: How to Stack Multilinears)
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_8openalex-snapshot
Sum-Check Protocol for Approximate Computations
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_17openalex-snapshot
Simple Attacks Against (Extended) Fiat-Shamir
inferred← citeshttps://doi.org/10.1007/978-3-032-26734-4_9openalex-snapshot
On the Power of Sumcheck in Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-26737-5_6openalex-snapshot
Interstellar: Efficient GKR-Based IVC Scheme with Privacy-Preserving Collaborative Folding
inferred← citeshttps://doi.org/10.1007/978-3-032-26740-5_9openalex-snapshot
Multi-hop Multi-key Homomorphic Signatures with Context Hiding from Standard Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-032-32560-0_11openalex-snapshot
Efficient Sum-Check for High-Degree Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-032-32764-2_10openalex-snapshot
Delegate: Coalition Proof Incentivized Outsourced Computation with Smart Contracts
inferred← citeshttps://doi.org/10.1007/978-3-032-35415-0_17openalex-snapshot
Round-Optimal GUC-Secure Blind Signatures From Minimal Computational and Setup Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_6openalex-snapshot
Succinct Zero-Knowledge Proofs from One-Way Functions: The Blackbox Way
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_8openalex-snapshot
Succinct Non-interactive Arguments for Distributions
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_9openalex-snapshot
Celer: A Lookup Argument for Large-Scale Queries
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_5openalex-snapshot
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems
inferred← citeshttps://doi.org/10.1007/978-981-95-5116-3_12openalex-snapshot
Scalable zkSNARKs for Matrix Computations
inferred← citeshttps://doi.org/10.1007/978-981-99-7032-2_30openalex-snapshot
When MPC in the Head Meets VC
inferred← citeshttps://doi.org/10.1007/s00037-025-00279-2openalex-snapshot
Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols
inferred← citeshttps://doi.org/10.1007/s00145-025-09551-8openalex-snapshot
Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
inferred← citeshttps://doi.org/10.1007/s00500-017-2569-8openalex-snapshot
Verifiable outsourcing of constrained nonlinear programming by particle swarm optimization in cloud
inferred← citeshttps://doi.org/10.1007/s10207-022-00590-xopenalex-snapshot
Efficient verifiable computation over quotient polynomial rings
inferred← citeshttps://doi.org/10.1007/s10207-024-00941-wopenalex-snapshot
Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs
inferred← citeshttps://doi.org/10.1007/s10619-024-07444-6openalex-snapshot
zk-Oracle: trusted off-chain compute and storage for decentralized applications
inferred← citeshttps://doi.org/10.1007/s10623-023-01222-8openalex-snapshot
Ligero: lightweight sublinear arguments without a trusted setup
inferred← citeshttps://doi.org/10.1007/s10623-024-01468-wopenalex-snapshot
Functional commitments for arbitrary circuits of bounded sizes
inferred← citeshttps://doi.org/10.1007/s11432-021-3393-xopenalex-snapshot
A survey on cryptographic techniques for protecting big data security: present and forthcoming
inferred← citeshttps://doi.org/10.1007/s11704-016-6148-4openalex-snapshot
Primitives towards verifiable computation: a survey
inferred← citeshttps://doi.org/10.1007/s12095-024-00723-0openalex-snapshot
Uni/multi variate polynomial embeddings for zkSNARKs
inferred← citeshttps://doi.org/10.1007/s12652-018-0757-8openalex-snapshot
HVDB: a hierarchical verifiable database scheme with scalable updates
inferred← citeshttps://doi.org/10.1007/s12652-019-01412-0openalex-snapshot
A dynamic data security mechanism based on position aware Merkle tree for health rehabilitation services over cloud
inferred← citeshttps://doi.org/10.1007/s42979-020-00243-7openalex-snapshot
A Blockchain-based Decentralized Electronic Marketplace for Computing Resources
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.114255openalex-snapshot
A sustainable urban optimization framework driven by a large language model based on multi-party trusted collaboration
inferred← citeshttps://doi.org/10.1016/j.cjph.2025.12.007openalex-snapshot
Practical cross-quantum homomorphic encryption with complete security
inferred← citeshttps://doi.org/10.1016/j.future.2020.09.028openalex-snapshot
Efficient verifiable databases with additional insertion and deletion operations in cloud computing
inferred← citeshttps://doi.org/10.1016/j.ins.2021.03.047openalex-snapshot
Towards reducing delegation overhead in replication-based verification: An incentive-compatible rational delegation computing scheme
inferred← citeshttps://doi.org/10.1016/j.ins.2023.01.036openalex-snapshot
Validating the integrity of Convolutional Neural Network predictions based on zero-knowledge proof
inferred← citeshttps://doi.org/10.1016/j.iot.2025.101638openalex-snapshot
Zero-knowledge machine learning models for blockchain peer-to-peer energy trading
inferred← citeshttps://doi.org/10.1016/j.jksuci.2024.102207openalex-snapshot
On-chain zero-knowledge machine learning: An overview and comparison
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.013openalex-snapshot
Elimination-based certificates for triangular equivalence and rank profiles
inferred← citeshttps://doi.org/10.1088/1674-1056/ac003bopenalex-snapshot
Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme*
inferred← citeshttps://doi.org/10.1088/1742-6596/1314/1/012157openalex-snapshot
Research on computing verification algorithm on body sensing data in cloud computing environment
inferred← citeshttps://doi.org/10.1109/access.2019.2908858openalex-snapshot
Towards Attack and Defense Views of Rational Delegation of Computation
inferred← citeshttps://doi.org/10.1109/access.2020.2971544openalex-snapshot
Cooperate Delegation of Computation for Rational Party Using Zero-Determinant Strategy Approach
inferred← citeshttps://doi.org/10.1109/access.2020.3041308openalex-snapshot
Practical Verifiable Computation by Using a Hardware-Based Correct Execution Environment
inferred← citeshttps://doi.org/10.1109/acsac63791.2024.00063openalex-snapshot
Privacy-Preserving Verifiable Neural Network Inference Service
inferred← citeshttps://doi.org/10.1109/aiiot52608.2021.9454203openalex-snapshot
Mutually Private Verifiable Machine Learning As-a-service: A Distributed Approach
inferred← citeshttps://doi.org/10.1109/bigdatasecurityhpscids54978.2022.00022openalex-snapshot
Practical Verifiable Computation on Encrypted Data
inferred← citeshttps://doi.org/10.1109/cns.2019.8802691openalex-snapshot
Secure Delegation to a Single Malicious Server: Exponentiation in RSA-type Groups
inferred← citeshttps://doi.org/10.1109/comst.2025.3561657openalex-snapshot
Zero-Knowledge Proof-Based Verifiable Decentralized Machine Learning in Communication Network: A Comprehensive Survey
inferred← citeshttps://doi.org/10.1109/cscwd68734.2026.11582359openalex-snapshot
Zero Knowledge Proofs of Inference for Neural Networks with Enhanced Privacy Protection
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00014openalex-snapshot
Formal Verification of the Sumcheck Protocol
inferred← citeshttps://doi.org/10.1109/eurosp68448.2026.00018openalex-snapshot
SUMMER: Recursive Zero-Knowledge Proofs for Scalable RNN Training
inferred← citeshttps://doi.org/10.1109/focs.2017.12openalex-snapshot
Distributed PCP Theorems for Hardness of Approximation in P
inferred← citeshttps://doi.org/10.1109/focs.2018.00017openalex-snapshot
Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems
inferred← citeshttps://doi.org/10.1109/focs.2018.00021openalex-snapshot
Delegating Computations with (Almost) Minimal Time and Space Overhead
inferred← citeshttps://doi.org/10.1109/focs.2019.00065openalex-snapshot
Stoquastic PCP vs. Randomness
inferred← citeshttps://doi.org/10.1109/focs.2019.00066openalex-snapshot
Computationally-Secure and Composable Remote State Preparation
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00083openalex-snapshot
Local Proofs Approaching the Witness Length [Extended Abstract]
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00021openalex-snapshot
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00048openalex-snapshot
Unstructured Hardness to Average-Case Randomness
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00092openalex-snapshot
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00039openalex-snapshot
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00049openalex-snapshot
Doubley-Efficient Interactive Proofs for Distribution Properties
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00061openalex-snapshot
Certified Hardness vs. Randomness for Log-Space
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00062openalex-snapshot
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00074openalex-snapshot
Polynomial-Time Pseudodeterministic Construction of Primes
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00041openalex-snapshot
Interactive Proofs for General Distribution Properties
inferred← citeshttps://doi.org/10.1109/gcwkshps45667.2019.9024678openalex-snapshot
Cooperate Delegation Computation for Rational Party Using Zero-Determinant Strategy
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408480openalex-snapshot
zkPHIRE: A Programmable Accelerator for ZKPs over HIgh-degRee, Expressive Gates
inferred← citeshttps://doi.org/10.1109/icaic60265.2024.10433831openalex-snapshot
zkFDL: An efficient and privacy-preserving decentralized federated learning with zero knowledge proof
inferred← citeshttps://doi.org/10.1109/icassp55912.2026.11462079openalex-snapshot
ZK-VSA: Zero-Knowledge Verifiable Speaker Anonymization Leveraging Phase Vocoder with Time-Scale Modification
inferred← citeshttps://doi.org/10.1109/infocomwkshps54753.2022.9798218openalex-snapshot
DHT-based Edge and Fog Computing Systems: Infrastructures and Applications
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174032openalex-snapshot
Interactive Verifiable Polynomial Evaluation
inferred← citeshttps://doi.org/10.1109/ispa/iucc.2017.00182openalex-snapshot
A Hierarchical VDB Scheme with Scalable Verification and Tampered Record Localization
inferred← citeshttps://doi.org/10.1109/jiot.2023.3280069openalex-snapshot
Integrating Blockchain and Deep Learning Into Extremely Resource-Constrained IoT: An Energy-Saving Zero-Knowledge PoL Approach
inferred← citeshttps://doi.org/10.1109/jiot.2023.3326358openalex-snapshot
Publicly Verifiable and Secure SVM Classification for Cloud-Based Health Monitoring Services
inferred← citeshttps://doi.org/10.1109/jiot.2023.3344709openalex-snapshot
RIETD: A Reputation Incentive Scheme Facilitates Personalized Edge Tampering Detection
inferred← citeshttps://doi.org/10.1109/micro61859.2024.00035openalex-snapshot
Accelerating Zero-Knowledge Proofs Through Hardware-Algorithm Co-Design
inferred← citeshttps://doi.org/10.1109/nana51271.2020.00030openalex-snapshot
Rational Delegation Learning Outsourcing Scheme Based on Game Theory
inferred← citeshttps://doi.org/10.1109/nana66698.2025.00025openalex-snapshot
SCS-RDL: A Smart Contract Scheme for Rational Delegation Learning
inferred← citeshttps://doi.org/10.1109/nca53618.2021.9685831openalex-snapshot
Verifiable Computing Using Computation Fingerprints Within FHE
inferred← citeshttps://doi.org/10.1109/sp.2018.00060openalex-snapshot
Doubly-Efficient zkSNARKs Without Trusted Setup
inferred← citeshttps://doi.org/10.1109/sp40000.2020.00052openalex-snapshot
Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof
inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179393openalex-snapshot
Less is more: refinement proofs for probabilistic proofs
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00054openalex-snapshot
Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00078openalex-snapshot
DataSeal: Ensuring the Verifiability of Private Computation on Encrypted Data
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00200openalex-snapshot
CoBBL: Dynamic Constraint Generation for SNARKs
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00204openalex-snapshot
HydraProofs: Optimally Computing All Proofs in a Vector Commitment (With Applications to Efficient zkSNARKs Over Data from Multiple Users)
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00205openalex-snapshot
FairZK: A Scalable System to Prove Machine Learning Fairness in Zero-Knowledge
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00028openalex-snapshot
VerfCNN, Optimal Complexity zkSNARK for Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00190openalex-snapshot
UltraProofs: Scalable Reed-Solomon Code Commitment
inferred← citeshttps://doi.org/10.1109/tdsc.2020.2969418openalex-snapshot
An Efficient NIZK Scheme for Privacy-Preserving Transactions Over Account-Model Blockchain
inferred← citeshttps://doi.org/10.1109/tdsc.2020.3032961openalex-snapshot
Privacy-Preserving Publicly Verifiable Databases
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3435010openalex-snapshot
An Efficient and Zero-Knowledge Classical Machine Learning Inference Pipeline
inferred← citeshttps://doi.org/10.1109/tifs.2020.2973864openalex-snapshot
Pay as You Decrypt: Decryption Outsourcing for Functional Encryption Using Blockchain
inferred← citeshttps://doi.org/10.1109/tifs.2021.3074869openalex-snapshot
Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1109/tifs.2023.3262932openalex-snapshot
pvCNN: Privacy-Preserving and Verifiable Convolutional Neural Network Testing
inferred← citeshttps://doi.org/10.1109/tifs.2023.3288454openalex-snapshot
A New Zero Knowledge Argument for General Circuits and Its Application
inferred← citeshttps://doi.org/10.1109/tifs.2024.3450288openalex-snapshot
Verifiable Coded Computation of Multiple Functions
inferred← citeshttps://doi.org/10.1109/tifs.2025.3537823openalex-snapshot
Einocchio: Efficiently Outsourcing Polynomial Computation With Verifiable Computation and Optimized Newton Interpolation
inferred← citeshttps://doi.org/10.1109/tit.2019.2930538openalex-snapshot
Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound
inferred← citeshttps://doi.org/10.1109/tkde.2019.2947061openalex-snapshot
Integrity Authentication for SQL Query Evaluation on Outsourced Databases: A Survey
inferred← citeshttps://doi.org/10.1109/tmc.2024.3437388openalex-snapshot
SecVerGSSL: Proof-Based Verified Computation for Graph Self-Supervised Learning
inferred← citeshttps://doi.org/10.1109/trustcom56396.2022.00085openalex-snapshot
Robust Secure Aggregation with Lightweight Verification for Federated Learning
inferred← citeshttps://doi.org/10.1109/tsc.2022.3215499openalex-snapshot
Privacy-Preserving and Publicly Verifiable Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/vts48691.2020.9107564openalex-snapshot
SafeTPU: A Verifiably Secure Hardware Accelerator for Deep Neural Networks
inferred← citeshttps://doi.org/10.1134/s0361768821080053openalex-snapshot
SafeComp: Protocol for Certifying Cloud Computations Integrity
inferred← citeshttps://doi.org/10.1137/1.9781611975994.67openalex-snapshot
The Power of Distributed Verifiers in Interactive Proofs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.140openalex-snapshot
Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH
inferred← citeshttps://doi.org/10.1137/16m1096773openalex-snapshot
Constant-Round Interactive Proofs for Delegating Computation
inferred← citeshttps://doi.org/10.1137/22m1475491openalex-snapshot
Hardness vs. Randomness, Revised: Uniform, Non-Black-Box, and Instance-wise
inferred← citeshttps://doi.org/10.1145/2897518.2897652openalex-snapshot
Constant-round interactive proofs for delegating computation
inferred← citeshttps://doi.org/10.1145/2933057.2933101openalex-snapshot
How Proofs are Prepared at Camelot
inferred← citeshttps://doi.org/10.1145/3055399.3055497openalex-snapshot
Non-interactive delegation and batch NP verification from standard computational assumptions
inferred← citeshttps://doi.org/10.1145/3087604.3087640openalex-snapshot
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits
inferred← citeshttps://doi.org/10.1145/3132747.3132760openalex-snapshot
The Efficient Server Audit Problem, Deduplicated Re-execution, and the Web
inferred← citeshttps://doi.org/10.1145/3133956.3133984openalex-snapshot
Full Accounting for Verifiable Outsourcing
inferred← citeshttps://doi.org/10.1145/3313276.3316411openalex-snapshot
How to delegate computations publicly
inferred← citeshttps://doi.org/10.1145/3372297.3417893openalex-snapshot
Ligero++: A New Optimized Sublinear IOP
inferred← citeshttps://doi.org/10.1145/3460120.3484558openalex-snapshot
ZKCPlus: Optimized Fair-exchange Protocol Supporting Practical and Flexible Data Exchange
inferred← citeshttps://doi.org/10.1145/3460120.3484767openalex-snapshot
Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time
inferred← citeshttps://doi.org/10.1145/3460120.3485379openalex-snapshot
zkCNN: Zero Knowledge Proofs for Convolutional Neural Network Predictions and Accuracy
inferred← citeshttps://doi.org/10.1145/3511100openalex-snapshot
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
inferred← citeshttps://doi.org/10.1145/3514221.3517851openalex-snapshot
Litmus: Towards a Practical Database Management System with Verifiable ACID Properties and Transaction Correctness
inferred← citeshttps://doi.org/10.1145/3519935.3519987openalex-snapshot
Verifying the unseen: interactive proofs for label-invariant distribution properties
inferred← citeshttps://doi.org/10.1145/3548606.3560653openalex-snapshot
Succinct Zero Knowledge for Floating Point Computations
inferred← citeshttps://doi.org/10.1145/3549523openalex-snapshot
SPARKs: Succinct Parallelizable Arguments of Knowledge
inferred← citeshttps://doi.org/10.1145/3555776.3577680openalex-snapshot
RMC-PVC: A Multi-Client Reusable Verifiable Computation Protocol
inferred← citeshttps://doi.org/10.1145/3564246.3585215openalex-snapshot
When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems
inferred← citeshttps://doi.org/10.1145/3564246.3585244openalex-snapshot
Constant-Round Arguments from One-Way Functions
inferred← citeshttps://doi.org/10.1145/3576915.3624403openalex-snapshot
Poster: Verifiable Encodings for Maliciously-Secure Homomorphic Encryption Evaluation
inferred← citeshttps://doi.org/10.1145/3604943.3604950openalex-snapshot
Guest Column: New ways of studying the BPP = P conjecture
inferred← citeshttps://doi.org/10.1145/3618260.3649772openalex-snapshot
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL
inferred← citeshttps://doi.org/10.1145/3618260.3649784openalex-snapshot
On the Power of Interactive Proofs for Learning
inferred← citeshttps://doi.org/10.1145/3627703.3650089openalex-snapshot
Efficient Auditing of Event-driven Web Applications
inferred← citeshttps://doi.org/10.1145/3658644.3670282openalex-snapshot
VERITAS: Plaintext Encoders for Practical Verifiable Homomorphic Encryption
inferred← citeshttps://doi.org/10.1145/3661483openalex-snapshot
Local Proofs Approaching the Witness Length
inferred← citeshttps://doi.org/10.1145/3666000.3672621openalex-snapshot
Corrigimus, verificamus, vincimus: Ensuring algorithmic accuracy in an age of uncertainty
inferred← citeshttps://doi.org/10.1145/3694715.3695962openalex-snapshot
NOPE: Strengthening domain authentication with succinct proofs
inferred← citeshttps://doi.org/10.1145/3709713openalex-snapshot
PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification
inferred← citeshttps://doi.org/10.1145/3716816.3727971openalex-snapshot
Lova: A Novel Framework for Verifying Mathematical Proofs with Incrementally Verifiable Computation
inferred← citeshttps://doi.org/10.1145/3717823.3718132openalex-snapshot
Time and Space Efficient Deterministic Decoders
inferred← citeshttps://doi.org/10.1145/3717823.3718172openalex-snapshot
Succinct Non-interactive Arguments of Proximity
inferred← citeshttps://doi.org/10.1145/3717823.3718177openalex-snapshot
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?)
inferred← citeshttps://doi.org/10.1145/3717823.3718198openalex-snapshot
Polynomial-Time PIT from (Almost) Necessary Assumptions
inferred← citeshttps://doi.org/10.1145/3717823.3718224openalex-snapshot
Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin
inferred← citeshttps://doi.org/10.1145/3798129.3800888openalex-snapshot
SNARKs from LWE via Non-black-Box Reductions
inferred← citeshttps://doi.org/10.1145/3803408openalex-snapshot
Polynomial-Time Pseudodeterministic Construction of Primes
inferred← citeshttps://doi.org/10.1145/3847111openalex-snapshot
Survey on Verifiable Machine Learning
inferred← citeshttps://doi.org/10.1186/s42162-019-0078-yopenalex-snapshot
Protecting the grid topology and user consumption patterns during state estimation in smart grids based on data obfuscation
inferred← citeshttps://doi.org/10.1360/sspma-2024-0355openalex-snapshot
Multi-party probabilistic quantum homomorphic encryption scheme based on Brown state
showing the first 200 of 216 · page through all 216
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.