On the public citation graph
Image density is complete for non-interactive-SZK
0 signed · 46 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/0-387-34799-2_4openalex-snapshot
Everything Provable is Provable in Zero-Knowledge
inferredcites →https://doi.org/10.1007/3-540-63165-8_225openalex-snapshot
Randomness-efficient non-interactive zero knowledge
inferredcites →https://doi.org/10.1007/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
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/0022-0000(91)90006-qopenalex-snapshot
Statistical zero-knowledge languages can be recognized in two rounds
inferredcites →https://doi.org/10.1016/0304-3975(94)90237-2openalex-snapshot
The knowledge complexity of quadratic residuosity languages
inferredcites →https://doi.org/10.1109/istcs.1993.253489openalex-snapshot
One-way functions are essential for non-trivial zero-knowledge
inferredcites →https://doi.org/10.1109/sfcs.1994.365745openalex-snapshot
On monotone formula closure of SZK
inferredcites →https://doi.org/10.1109/sfcs.1997.646133openalex-snapshot
A complete promise problem for statistical zero-knowledge
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/100216.100273openalex-snapshot
Public-key cryptosystems provably secure against chosen ciphertext attacks
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/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/225058.225186openalex-snapshot
Knowledge on the average---perfect, statistical and logarithmic
inferredcites →https://doi.org/10.1145/237814.238016openalex-snapshot
On relationships between statistical zero-knowledge proofs
inferredcites →https://doi.org/10.1145/28395.28418openalex-snapshot
The complexity of perfect zero-knowledge
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11535218_8openalex-snapshot
Unconditional Characterizations of Non-interactive Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/11761679_21openalex-snapshot
Perfect Non-interactive Zero Knowledge for NP
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_33openalex-snapshot
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_1openalex-snapshot
On the (Im)possibility of Obfuscating Programs
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_30openalex-snapshot
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_6openalex-snapshot
Batch Verification for Statistical Zero Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-44807-2_6openalex-snapshot
Information-Theoretic Cryptography: Life Cycle, Ecosystem, and the Promise of Quantum-Inspired AI
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_9openalex-snapshot
Strong Batching for Non-interactive Statistical Zero-Knowledge
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-319-70500-2_2openalex-snapshot
On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_20openalex-snapshot
Non-interactive Quantum Perfect and Statistical Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_5openalex-snapshot
The Complexity of Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_6openalex-snapshot
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_30openalex-snapshot
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_34openalex-snapshot
Complete Problem for Perfect Zero-Knowledge Quantum Proof
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_16openalex-snapshot
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
inferred← citeshttps://doi.org/10.1007/s00037-018-0170-xopenalex-snapshot
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
inferred← citeshttps://doi.org/10.1007/s00145-002-0113-0openalex-snapshot
Trading Help for Interaction in Statistical Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1109/focs.2004.13openalex-snapshot
An Unconditional Study of Computational Zero Knowledge
inferred← citeshttps://doi.org/10.1145/2160158.2160159openalex-snapshot
On the (im)possibility of obfuscating programs
inferred← citeshttps://doi.org/10.1145/2220357.2220358openalex-snapshot
New Techniques for Noninteractive Zero-Knowledge
inferred← citeshttps://doi.org/10.1145/335305.335336openalex-snapshot
On zero-knowledge proofs (extended abstract)
inferred← citeshttps://doi.org/10.1145/3708508openalex-snapshot
Robustness for Space-Bounded Statistical Zero Knowledge
inferred← citeshttps://doi.org/10.3390/e24020266openalex-snapshot
The Odyssey of Entropy: Cryptography
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0207158openalex-snapshot
Non-Interactive Quantum Statistical and Perfect Zero-Knowledge
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.