On the public citation graph
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
0 signed · 53 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.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1007/0-387-34805-0_46openalex-snapshot
Zero Knowledge Proofs of Knowledge in Two Rounds
inferredcites →https://doi.org/10.1007/3-540-39118-5_13openalex-snapshot
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
inferredcites →https://doi.org/10.1007/3-540-47721-7_13openalex-snapshot
Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How
inferredcites →https://doi.org/10.1007/3-540-47721-7_14openalex-snapshot
Demonstrating Possession of a Discrete Logarithm Without Revealing it
inferredcites →https://doi.org/10.1007/3-540-47721-7_15openalex-snapshot
Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols
inferredcites →https://doi.org/10.1007/3-540-47721-7_16openalex-snapshot
Zero-Knowledge Simulation of Boolean Circuits
inferredcites →https://doi.org/10.1007/3-540-48184-2_4openalex-snapshot
Direct Minimum-Knowledge Computations (Extended Abstract)
inferredcites →https://doi.org/10.1007/3-540-48184-2_7openalex-snapshot
Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result
inferredcites →https://doi.org/10.1007/bf00204448openalex-snapshot
A discrete logarithm implementation of perfect zero-knowledge blobs
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1109/sfcs.1986.33openalex-snapshot
Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond
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/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
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.1006/jcss.1998.1614openalex-snapshot
Algorithms for Matrix Groups and the Tits Alternative
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_46openalex-snapshot
Zero Knowledge Proofs of Knowledge in Two Rounds
inferred← citeshttps://doi.org/10.1007/3-540-44750-4_26openalex-snapshot
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/3-540-46766-1_16openalex-snapshot
A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
inferred← citeshttps://doi.org/10.1007/3-540-46877-3_5openalex-snapshot
Public-Randomness in Public-Key Cryptography
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_22openalex-snapshot
Zero-Knowledge Proofs of Computational Power
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_14openalex-snapshot
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_23openalex-snapshot
Interactive Hashing Simplifies Zero-Knowledge Protocol Design
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_203openalex-snapshot
Secure commitment against a powerful adversary
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_204openalex-snapshot
Communication efficient Zero-knowledge Proofs of knowledge
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_28openalex-snapshot
On the complexity of constant round ZKIP of possession of knowledge
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_32openalex-snapshot
An extension of zero-knowledge proofs and its applications
inferred← citeshttps://doi.org/10.1007/978-3-031-22912-1_29openalex-snapshot
Two Remarks on the Vectorization Problem
inferred← citeshttps://doi.org/10.1007/bf01200756openalex-snapshot
A one-round, two-prover, zero-knowledge protocol for NP
inferred← citeshttps://doi.org/10.1007/bfb0020803openalex-snapshot
Computationally convincing proofs of knowledge
inferred← citeshttps://doi.org/10.1007/bfb0055744openalex-snapshot
On the existence of 3-round zero-knowledge protocols
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90259-5openalex-snapshot
Constant-round perfect zero-knowledge computationally convincing protocols
inferred← citeshttps://doi.org/10.1016/b978-0-12-800161-5.00002-5openalex-snapshot
A Survey on Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.010openalex-snapshot
Lower bounds for non-black-box zero knowledge
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366844openalex-snapshot
Las Vegas algorithms for matrix groups
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492589openalex-snapshot
Algorithms for matrix groups and the Tits alternative
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238212openalex-snapshot
Lower bounds for non-black-box zero knowledge
inferred← citeshttps://doi.org/10.1109/sicon.1993.515641openalex-snapshot
Two round ZKIP of knowledge for SAT and its applications
inferred← citeshttps://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferred← citeshttps://doi.org/10.1145/100216.100283openalex-snapshot
Perfect zero-knowledge in constant rounds
inferred← citeshttps://doi.org/10.1145/100216.100285openalex-snapshot
The (true) complexity of statistical zero knowledge
inferred← citeshttps://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferred← citeshttps://doi.org/10.1145/509907.509979openalex-snapshot
Strict polynomial-time in simulation and extraction
inferred← citeshttps://doi.org/10.70675/6eb52bdczbeffz4452zaa38zbf37b5216c90openalex-snapshot
Securing data access and exchanges in a heterogeneous ecosystem : An adaptive and context-sensitive approach
inferred← citeshttps://doi.org/10.7146/brics.v1i39.21604openalex-snapshot
Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)
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.