On the public citation graph
On Round-Efficient Argument Systems
0 signed · 52 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/11753728_1openalex-snapshot
Non-black-box Techniques in Cryptography
inferredcites →https://doi.org/10.1007/3-540-47721-7openalex-snapshot
Advances in Cryptology — CRYPTO’ 86
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/978-3-540-24638-1_7openalex-snapshot
On the Possibility of One-Message Weak Zero-Knowledge
inferredcites →https://doi.org/10.1007/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1007/s001459900032openalex-snapshot
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
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(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/s0020-0190(98)00116-1openalex-snapshot
On the complexity of interactive proofs with bounded communication
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/ccc.2002.1004355openalex-snapshot
Universal Arguments and their Applications
inferredcites →https://doi.org/10.1109/sfcs.1997.646126openalex-snapshot
Does parallel repetition lower the error in computationally sound protocols?
inferredcites →https://doi.org/10.1109/sfcs.2000.892119openalex-snapshot
Lower bounds on the efficiency of generic cryptographic constructions
inferredcites →https://doi.org/10.1109/sfcs.2001.959885openalex-snapshot
How to go beyond the black-box simulation barrier
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/sfcs.2003.1238212openalex-snapshot
Lower bounds for non-black-box zero knowledge
inferredcites →https://doi.org/10.1137/s0097539792230010openalex-snapshot
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
inferredcites →https://doi.org/10.1137/s0097539795284959openalex-snapshot
Computationally Sound Proofs
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/276698.276741openalex-snapshot
The random oracle methodology, revisited (preliminary version)
inferredcites →https://doi.org/10.1145/28395.28418openalex-snapshot
The complexity of perfect zero-knowledge
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-30530-7_11openalex-snapshot
Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_26openalex-snapshot
On Succinct Arguments and Witness Encryption from Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-18283-9_11openalex-snapshot
On Interactive Oracle Proofs for Boolean R1CS Statements
inferred← citeshttps://doi.org/10.1007/978-3-031-37679-5_20openalex-snapshot
Impossibilities in Succinct Arguments: Black-Box Extraction and More
inferred← citeshttps://doi.org/10.1007/978-3-031-68403-6_3openalex-snapshot
Adaptive Security in SNARGs via iO and Lossy Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_7openalex-snapshot
Unique SNARGs with Adaptive Security: Constructions and Black-Box Separations
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_8openalex-snapshot
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_16openalex-snapshot
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
inferred← citeshttps://doi.org/10.1007/978-3-642-36362-7_30openalex-snapshot
On the Connection between Leakage Tolerance and Adaptive Security
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_18openalex-snapshot
Succinct Non-interactive Arguments via Linear Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_6openalex-snapshot
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_5openalex-snapshot
On the (In)Security of SNARKs in the Presence of Oracles
inferred← citeshttps://doi.org/10.1007/978-3-662-54365-8_14openalex-snapshot
Fully Leakage-Resilient Codes
inferred← citeshttps://doi.org/10.1007/s00145-022-09424-4openalex-snapshot
Succinct Non-Interactive Arguments via Linear Interactive Proofs
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.1145/1993636.1993651openalex-snapshot
Separating succinct non-interactive arguments from all falsifiable assumptions
inferred← citeshttps://doi.org/10.1145/2090236.2090263openalex-snapshot
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
inferred← citeshttps://doi.org/10.1145/2422436.2422481openalex-snapshot
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/2488608.2488623openalex-snapshot
Recursive composition and bootstrapping for SNARKS and proof-carrying data
inferred← citeshttps://doi.org/10.1145/3618260.3649671openalex-snapshot
Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation
inferred← citeshttps://doi.org/10.1145/3618260.3649775openalex-snapshot
Batch Proofs Are Statistically Hiding
inferred← citeshttps://doi.org/10.1515/jmc.2008.016openalex-snapshot
Polylogarithmic two-round argument systems
inferred← citeshttps://doi.org/10.62056/anudy76bmopenalex-snapshot
Improved Constant-Sized Polynomial Commitment Schemes Without Trusted Setup
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.