On the public citation graph

On Doubly-Efficient Interactive Proof Systems

0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/j.ic.2005.05.001openalex-snapshot
Tight lower bounds for certain parameterized NP-hard problems
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/110829660openalex-snapshot
IP = PSPACE Using Error-Correcting Codes
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/s0097539795284959openalex-snapshot
Computationally Sound Proofs
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/146585.146609openalex-snapshot
IP = PSPACE
inferredcites →https://doi.org/10.1145/2488608.2488679openalex-snapshot
Delegation for bounded space
inferredcites →https://doi.org/10.1145/2591796.2591809openalex-snapshot
How to delegate computations
inferredcites →https://doi.org/10.1145/2933057.2933101openalex-snapshot
How Proofs are Prepared at Camelot

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-30617-4_16openalex-snapshot
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption
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-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_18openalex-snapshot
Zero-Knowledge in Streaming Interactive Proofs
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.1109/focs46700.2020.00083openalex-snapshot
Local Proofs Approaching the Witness Length [Extended Abstract]
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00119openalex-snapshot
Is it Easier to Prove Theorems that are Guaranteed to be True?
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00095openalex-snapshot
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness
inferred← citeshttps://doi.org/10.1145/3576915.3623078openalex-snapshot
Recursion over Public-Coin Interactive Proof Systems; Faster Hash Verification
inferred← citeshttps://doi.org/10.1145/3618260.3649775openalex-snapshot
Batch Proofs Are Statistically Hiding
inferred← citeshttps://doi.org/10.1145/3661483openalex-snapshot
Local Proofs Approaching the Witness Length
inferred← citeshttps://doi.org/10.1145/3803408openalex-snapshot
Polynomial-Time Pseudodeterministic Construction of Primes
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.