On the public citation graph
Proofs, Arguments, and Zero-Knowledge
0 signed · 138 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.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1007/3-540-52282-4_44openalex-snapshot
Efficient checking of computations
inferredcites →https://doi.org/10.1007/978-3-540-68164-9_25openalex-snapshot
On Compressible Pairings and Their Computation
inferredcites →https://doi.org/10.1007/978-3-642-02017-9_21openalex-snapshot
Best-Order Streaming Model
inferredcites →https://doi.org/10.1007/978-3-642-36594-2_13openalex-snapshot
Signatures of Correct Computation
inferredcites →https://doi.org/10.1007/978-3-662-49096-9_17openalex-snapshot
On the Correlation Intractability of Obfuscated Pseudorandom Functions
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bfb0054319openalex-snapshot
Quantum cryptanalysis of hash and claw-free functions
inferredcites →https://doi.org/10.1007/s00037-002-0169-0openalex-snapshot
On interactive proofs with a laconic prover
inferredcites →https://doi.org/10.1007/s00037-005-0197-7openalex-snapshot
Derandomizing Arthur–Merlin Games using Hitting Sets
inferredcites →https://doi.org/10.1007/s00145-010-9067-9openalex-snapshot
A Verifiable Secret Shuffle of Homomorphic Encryptions
inferredcites →https://doi.org/10.1007/s001450010003openalex-snapshot
Security Arguments for Digital Signatures and Blind Signatures
inferredcites →https://doi.org/10.1007/s00493-003-0025-0openalex-snapshot
Improved Low-Degree Testing and its Applications
inferredcites →https://doi.org/10.1007/s10623-015-0094-2openalex-snapshot
The random oracle model: a twenty-year retrospective
inferredcites →https://doi.org/10.1007/s10817-020-09581-wopenalex-snapshot
Formalising Σ-Protocols and Commitment Schemes using CryptHOL.
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1016/0022-0000(91)90006-qopenalex-snapshot
Statistical zero-knowledge languages can be recognized in two rounds
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/j.tcs.2007.06.013openalex-snapshot
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferredcites →https://doi.org/10.1109/focs.2018.00021openalex-snapshot
Delegating Computations with (Almost) Minimal Time and Space Overhead
inferredcites →https://doi.org/10.1109/focs46700.2020.00088openalex-snapshot
On Proximity Gaps of Reed-Solomon Codes
inferredcites →https://doi.org/10.1109/sct.1988.5275openalex-snapshot
On the power of multi-power interactive protocols
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
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.47openalex-snapshot
Pinocchio: Nearly Practical Verifiable Computation
inferredcites →https://doi.org/10.1109/sp.2018.00020openalex-snapshot
Bulletproofs: Short Proofs for Confidential Transactions and More
inferredcites →https://doi.org/10.1109/sp40000.2020.00048openalex-snapshot
How not to prove your election outcome
inferredcites →https://doi.org/10.1109/sp40000.2020.00050openalex-snapshot
ZEXE: Enabling Decentralized Private Computation
inferredcites →https://doi.org/10.1109/sp40000.2020.00052openalex-snapshot
Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof
inferredcites →https://doi.org/10.1109/sp40001.2021.00056openalex-snapshot
Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1109/tit.2016.2608892openalex-snapshot
Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
inferredcites →https://doi.org/10.1137/0209022openalex-snapshot
On the Evaluation of Powers and Monomials
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/050646445openalex-snapshot
Short PCPs with Polylog Query Complexity
inferredcites →https://doi.org/10.1137/060656838openalex-snapshot
Sub-Constant Error Low Degree Test of Almost-Linear Size
inferredcites →https://doi.org/10.1137/080725398openalex-snapshot
Zero-Knowledge Proofs from Secure Multiparty Computation
inferredcites →https://doi.org/10.1137/110829660openalex-snapshot
IP = PSPACE Using Error-Correcting Codes
inferredcites →https://doi.org/10.1137/s0097539700389652openalex-snapshot
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0097539795284959openalex-snapshot
Computationally Sound Proofs
inferredcites →https://doi.org/10.1145/1008731.1008734openalex-snapshot
The random oracle methodology, revisited
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/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/2090236.2090245openalex-snapshot
Practical verified computation with streaming interactive proofs
inferredcites →https://doi.org/10.1145/2517349.2522733openalex-snapshot
Verifying computations with state
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/2608628.2608664openalex-snapshot
Powers of tensors and fast matrix multiplication
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/28395.28418openalex-snapshot
The complexity of perfect zero-knowledge
inferredcites →https://doi.org/10.1145/2897518.2897542openalex-snapshot
Graph isomorphism in quasipolynomial time [extended abstract]
inferredcites →https://doi.org/10.1145/2897518.2897652openalex-snapshot
Constant-round interactive proofs for delegating computation
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/3313276.3316380openalex-snapshot
Fiat-Shamir: from practice to theory
inferredcites →https://doi.org/10.1145/3406325.3451055openalex-snapshot
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
inferredcites →https://doi.org/10.1145/358549.358563openalex-snapshot
Untraceable electronic mail, return addresses, and digital pseudonyms
inferredcites →https://doi.org/10.14778/2047485.2047488openalex-snapshot
Verifying computations with streaming interactive proofs
inferredcites →https://doi.org/10.46586/tches.v2020.i4.154-188openalex-snapshot
Improving the Performance of the Picnic Signature Scheme
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-031-52477-6_2openalex-snapshot
Fundamental Data Security Technologies
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_1openalex-snapshot
Jolt: SNARKs for Virtual Machines via Lookups
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_7openalex-snapshot
Unlocking the Lookup Singularity with Lasso
inferred← citeshttps://doi.org/10.1007/978-3-031-66047-4_6openalex-snapshot
Privacy-Enhancing Technologies
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_11openalex-snapshot
Certifying Private Probabilistic Mechanisms
inferred← citeshttps://doi.org/10.1007/978-3-031-68403-6_9openalex-snapshot
Field-Agnostic SNARKs from Expand-Accumulate Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-70445-1_3openalex-snapshot
Interpreted and Confidential Execution of Process Choreographies on a Blockchain
inferred← citeshttps://doi.org/10.1007/978-3-031-78011-0_1openalex-snapshot
Instance-Hiding Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-91054-8_1openalex-snapshot
Privacy-Preserving Authentication: Theory vs. Practice
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-031-91820-9_14openalex-snapshot
Transparent SNARKs over Galois Rings
inferred← citeshttps://doi.org/10.1007/978-3-032-01806-9_14openalex-snapshot
Enhancing E-Voting with Multiparty Class Group Encryption
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_5openalex-snapshot
More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials
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-01907-3_9openalex-snapshot
$$\textsf{Zinc}$$: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers
inferred← citeshttps://doi.org/10.1007/978-3-032-12287-2_12openalex-snapshot
Linear Prover IOPs in Log Star Rounds
inferred← citeshttps://doi.org/10.1007/978-3-032-12287-2_15openalex-snapshot
SNARK Lower Bounds via Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_7openalex-snapshot
Dynark: Making Groth16 Dynamic
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-26734-4_9openalex-snapshot
On the Power of Sumcheck in Secure Multiparty Computation
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-35424-2_10openalex-snapshot
Twist and Shout: Faster Memory Checking Arguments via One-Hot Addressing and Increments
inferred← citeshttps://doi.org/10.1007/978-3-032-35428-0_20openalex-snapshot
Random Variable Commitments for Any Sampleable Distribution, and a Certified Laplace Mechanism
inferred← citeshttps://doi.org/10.1007/978-981-92-3012-9_9openalex-snapshot
Transparent Fully Batchable Polynomial Commitment with Application to Scalable VSS
inferred← citeshttps://doi.org/10.1007/978-981-95-5015-9_12openalex-snapshot
Towards Trusted Service Monitoring: Verifiable Service Level Agreements
inferred← citeshttps://doi.org/10.1007/978-981-95-5116-3_13openalex-snapshot
A Crack in the Firmament: Restoring Soundness of the Orion Proof System and More
inferred← citeshttps://doi.org/10.1007/s00145-026-09573-wopenalex-snapshot
Instance-Hiding Interactive Proofs
inferred← citeshttps://doi.org/10.1007/s10207-025-01047-7openalex-snapshot
Verifiability for privacy-preserving computing on distributed data — a survey
inferred← citeshttps://doi.org/10.1007/s11704-025-50244-zopenalex-snapshot
CP-SuperSpartan: commit-and-prove SNARKs for customizable constraint systems
inferred← citeshttps://doi.org/10.1016/j.bcra.2026.100507openalex-snapshot
ZeroMT+: Towards scalable privacy in account-model blockchain
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.jisa.2024.103794openalex-snapshot
ZeroMT: Towards Multi-Transfer transactions with privacy for account-based blockchain
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114799openalex-snapshot
Towards zero knowledge argument for double discrete logarithm with constant cost
inferred← citeshttps://doi.org/10.1103/j3xf-bw18openalex-snapshot
Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00014openalex-snapshot
Formal Verification of the Sumcheck Protocol
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00030openalex-snapshot
A Maintainable Matrix Commitment Scheme with Constant-Size Public Parameters and Incremental Aggregation
inferred← citeshttps://doi.org/10.1109/dsn-s60304.2024.00028openalex-snapshot
Zero-Knowledge Proofs for Blockchains
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00057openalex-snapshot
Dot-Product Proofs and Their Applications
inferred← citeshttps://doi.org/10.1109/sp46214.2022.9833792openalex-snapshot
Multi-Server Verifiable Computation of Low-Degree Polynomials
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00086openalex-snapshot
Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs Post-Quantum ZK-SNARKs on a Browser
inferred← citeshttps://doi.org/10.1109/tifs.2023.3347897openalex-snapshot
Generic Construction of Threshold Credential Management With User-Autonomy Aggregation
inferred← citeshttps://doi.org/10.1109/trustcom63139.2024.00303openalex-snapshot
ZKFDT: A Fair Exchange Scheme for Data Trading Based on Efficient Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1145/3597503.3639131openalex-snapshot
When Contracts Meets Crypto: Exploring Developers' Struggles with Ethereum Cryptographic APIs
inferred← citeshttps://doi.org/10.1145/3618260.3649698openalex-snapshot
Perfect Zero-Knowledge PCPs for #P
inferred← citeshttps://doi.org/10.1145/3627703.3650088openalex-snapshot
ZKML: An Optimizing System for ML Inference in Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1145/3658644.3670334openalex-snapshot
zkLLM: Zero Knowledge Proofs for Large Language Models
inferred← citeshttps://doi.org/10.1145/3708821.3736204openalex-snapshot
LogaLookup: Efficient Multivariate Lookup Argument for Accelerated Proof Generation
inferred← citeshttps://doi.org/10.1145/3713081.3731718openalex-snapshot
Towards Fuzzing Zero-Knowledge Proof Circuits (Short Paper)
inferred← citeshttps://doi.org/10.1145/3719027.3744810openalex-snapshot
QV-net: Decentralized Self-Tallying Quadratic Voting with Maximal Ballot Secrecy
inferred← citeshttps://doi.org/10.1145/3721477openalex-snapshot
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead
inferred← citeshttps://doi.org/10.1145/3735505openalex-snapshot
The Power and Potential of Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1145/3805689.3812373openalex-snapshot
Don't Trust the Process: When Verifiability Undermines AI Accountability
inferred← citeshttps://doi.org/10.1145/3833384openalex-snapshot
Vector Commitment Design, Analysis, and Applications: A Survey
inferred← citeshttps://doi.org/10.1145/3842752openalex-snapshot
Fully Decentralized NFT Storage through Frequency Domain Neural Network Compression
inferred← citeshttps://doi.org/10.1145/3847192.3847358openalex-snapshot
Verifiable Blind Pseudonymization via Polymorphic Encryption Using Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.14722/ndss.2022.23143openalex-snapshot
Transparency Dictionaries with Succinct Proofs of Correct Operation
inferred← citeshttps://doi.org/10.2139/ssrn.5668516openalex-snapshot
Designing practical blockchain-based green electricity labeling with succinct non-interactive zero-knowledge proof
inferred← citeshttps://doi.org/10.26583/bit.2024.1.04openalex-snapshot
Ensuring the privacy of information in distributed ledger systems with zero-knowledge proofs
inferred← citeshttps://doi.org/10.3389/ffutr.2026.1972925openalex-snapshot
Semi-supervised zero-knowledge federated learning for intelligent transportation systems
inferred← citeshttps://doi.org/10.3390/info16121066openalex-snapshot
Trustworthy Data Space Collaborative Trust Mechanism Driven by Blockchain: Technology Integration, Cross-Border Governance, and Standardization Path
inferred← citeshttps://doi.org/10.4995/thesis/10251/198106openalex-snapshot
Distributed Cryptographic Protocols
inferred← citeshttps://doi.org/10.62056/abksdk5vtopenalex-snapshot
A divide-and-conquer sumcheck protocol
inferred← citeshttps://doi.org/10.70675/bc9e0533z7737z4874z84b6z06616d3f3aaaopenalex-snapshot
On scaling-up online multi-agent multi-task assignment
inferred← citeshttps://doi.org/10.71229/7854y715openalex-snapshot
Scalable Blockchain-Based Electronic Evidence Sharing Using HotStuffle Consensus and Zero-Knowledge Proofs
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.