On the public citation graph
A one-round, two-prover, zero-knowledge protocol for NP
0 signed · 36 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/3-540-46885-4_21openalex-snapshot
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
inferredcites →https://doi.org/10.1007/3-540-48071-4_28openalex-snapshot
On Defining Proofs of Knowledge
inferredcites →https://doi.org/10.1007/3-540-52282-4_32openalex-snapshot
Playing games of incomplete information
inferredcites →https://doi.org/10.1007/bfb0035756openalex-snapshot
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1109/sct.1988.5275openalex-snapshot
On the power of multi-power interactive protocols
inferredcites →https://doi.org/10.1109/sct.1991.160251openalex-snapshot
On the success probability of the two provers in one-round proof systems
inferredcites →https://doi.org/10.1109/sfcs.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1109/sfcs.1991.185342openalex-snapshot
Fully parallelized multi prover protocols for NEXP-time
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferredcites →https://doi.org/10.1145/100216.100283openalex-snapshot
Perfect zero-knowledge in constant rounds
inferredcites →https://doi.org/10.1145/28395.28418openalex-snapshot
The complexity of perfect zero-knowledge
inferredcites →https://doi.org/10.1145/28395.28419openalex-snapshot
Zero knowledge proofs of identity
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-319-56617-7_13openalex-snapshot
Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_6openalex-snapshot
Zero Knowledge Protocols from Succinct Constraint Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_10openalex-snapshot
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_2openalex-snapshot
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
inferred← citeshttps://doi.org/10.1007/s00037-013-0071-yopenalex-snapshot
Derandomized Parallel Repetition Theorems for Free Games
inferred← citeshttps://doi.org/10.1109/ccc.1996.507669openalex-snapshot
Error reduction by parallel repetition-a negative result
inferred← citeshttps://doi.org/10.1109/ccc.2010.12openalex-snapshot
Derandomized Parallel Repetition Theorems for Free Games
inferred← citeshttps://doi.org/10.1109/cec-eee.2007.85openalex-snapshot
Secure e-Cheque Clearance between Financial Institutions
inferred← citeshttps://doi.org/10.1109/sct.1994.315794openalex-snapshot
Towards the parallel repetition conjecture
inferred← citeshttps://doi.org/10.1137/080734042openalex-snapshot
Parallel Repetition in Projection Games and a Concentration Bound
inferred← citeshttps://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferred← citeshttps://doi.org/10.1137/s0097539797325375openalex-snapshot
Two-Prover Protocols---Low Error at Affordable Rates
inferred← citeshttps://doi.org/10.1142/s012905410100062xopenalex-snapshot
REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM
inferred← citeshttps://doi.org/10.1145/3618260.3649698openalex-snapshot
Perfect Zero-Knowledge PCPs for #P
inferred← citeshttps://doi.org/10.4036/iis.2015.l.01openalex-snapshot
Parallel Repetition of Two-Prover One-Round Games: An Exposition
inferred← citeshttps://doi.org/10.4230/lipics.itc.2020.4openalex-snapshot
Practical Relativistic Zero-Knowledge for NP
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.