On the public citation graph

On Relationships between Statistical Zero-Knowledge Proofs

0 signed · 78 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.1007/0-387-34799-2_4openalex-snapshot
Everything Provable is Provable in Zero-Knowledge
inferredcites →https://doi.org/10.1007/3-540-44750-4_26openalex-snapshot
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/3-540-48285-7_23openalex-snapshot
Interactive Hashing Simplifies Zero-Knowledge Protocol Design
inferredcites →https://doi.org/10.1007/3-540-48329-2_9openalex-snapshot
Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
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(91)90006-qopenalex-snapshot
Statistical zero-knowledge languages can be recognized in two rounds
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/fscs.1990.89518openalex-snapshot
Algebraic methods for interactive proof systems
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.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1109/sfcs.1987.35openalex-snapshot
Interactive proof systems: Provers that never fail and random selection
inferredcites →https://doi.org/10.1109/sfcs.1991.185349openalex-snapshot
Quantifying knowledge complexity
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/s0097539795280524openalex-snapshot
Computational Complexity and Knowledge Complexity
inferredcites →https://doi.org/10.1145/100216.100270openalex-snapshot
Pseudo-random generators under uniform assumptions
inferredcites →https://doi.org/10.1145/100216.100285openalex-snapshot
The (true) complexity of statistical zero knowledge
inferredcites →https://doi.org/10.1145/146585.146609openalex-snapshot
IP = PSPACE
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/237814.238016openalex-snapshot
On relationships between statistical zero-knowledge proofs
inferredcites →https://doi.org/10.1145/276698.276852openalex-snapshot
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
inferredcites →https://doi.org/10.1145/28395.28418openalex-snapshot
The complexity of perfect zero-knowledge
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
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/11681878_1openalex-snapshot
Concurrent Zero Knowledge Without Complexity Assumptions
inferred← citeshttps://doi.org/10.1007/11685654_12openalex-snapshot
On Promise Problems: A Survey
inferred← citeshttps://doi.org/10.1007/11818175_25openalex-snapshot
Random Selection with an Adversarial Majority
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_28openalex-snapshot
On Interactive Proofs with a Laconic Prover
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_29openalex-snapshot
The Untold Story of $$\mathsf {SBP}$$
inferred← citeshttps://doi.org/10.1007/978-3-030-64375-1_24openalex-snapshot
Perfect Zero Knowledge: New Upperbounds and Relativized Separations
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-030-77883-5_8openalex-snapshot
Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-78011-0_1openalex-snapshot
Instance-Hiding Interactive Proofs
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-319-76581-5_21openalex-snapshot
New (and Old) Proof Systems for Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_26openalex-snapshot
On the Complexity of Compressing Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_17openalex-snapshot
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_11openalex-snapshot
On Best-Possible Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_11openalex-snapshot
Zero Knowledge and Soundness Are Symmetric
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_27openalex-snapshot
An Equivalence Between Zero Knowledge and Commitments
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_28openalex-snapshot
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
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-78524-8_7openalex-snapshot
General Properties of Quantum Zero-Knowledge Proofs
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-29952-0_29openalex-snapshot
A Surprisingly Simple Way of Reversing Trace Distance via Entanglement
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_8openalex-snapshot
Statistical Concurrent Non-malleable Zero Knowledge
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-002-0169-0openalex-snapshot
On interactive proofs with a laconic prover
inferred← citeshttps://doi.org/10.1007/s00037-016-0124-0openalex-snapshot
The Minimum Oracle Circuit Size Problem
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-006-0346-4openalex-snapshot
Completeness in Two-Party Secure Computation: A Computational View
inferred← citeshttps://doi.org/10.1007/s00145-013-9151-zopenalex-snapshot
On Best-Possible Obfuscation
inferred← citeshttps://doi.org/10.1007/s00145-022-09431-5openalex-snapshot
On the Complexity of Compressing Obfuscation
inferred← citeshttps://doi.org/10.1007/s00145-026-09573-wopenalex-snapshot
Instance-Hiding Interactive Proofs
inferred← citeshttps://doi.org/10.1016/j.aim.2014.01.007openalex-snapshot
Knottedness is in NP , modulo GRH
inferred← citeshttps://doi.org/10.1016/j.ic.2017.07.008openalex-snapshot
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.031openalex-snapshot
A framework for non-interactive instance-dependent commitment schemes (NIC)
inferred← citeshttps://doi.org/10.1109/ccc.2010.17openalex-snapshot
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
inferred← citeshttps://doi.org/10.1109/focs.2004.13openalex-snapshot
An Unconditional Study of Computational Zero Knowledge
inferred← citeshttps://doi.org/10.1109/focs.2012.71openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181970openalex-snapshot
Limits on the power of quantum statistical zero-knowledge
inferred← citeshttps://doi.org/10.1137/130927115openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferred← citeshttps://doi.org/10.1137/17m1157970openalex-snapshot
Minimum Circuit Size, Graph Isomorphism, and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539705447207openalex-snapshot
An Unconditional Study of Computational Zero Knowledge
inferred← citeshttps://doi.org/10.1137/s0097539798346123openalex-snapshot
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
inferred← citeshttps://doi.org/10.1145/1007352.1007395openalex-snapshot
Completeness in two-party secure computation
inferred← citeshttps://doi.org/10.1145/1132516.1132559openalex-snapshot
Zero knowledge with efficient provers
inferred← citeshttps://doi.org/10.1145/276698.276852openalex-snapshot
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
inferred← citeshttps://doi.org/10.1145/3708508openalex-snapshot
Robustness for Space-Bounded Statistical Zero Knowledge
inferred← citeshttps://doi.org/10.1145/636865.636868openalex-snapshot
A complete problem for statistical zero knowledge
inferred← citeshttps://doi.org/10.1561/0400000068openalex-snapshot
Quantum Proofs
inferred← citeshttps://doi.org/10.1561/9781680831276openalex-snapshot
Quantum Proofs
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0202111openalex-snapshot
Quantum statistical 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.