On the public citation graph

Unconditional Characterizations of Non-interactive Zero-Knowledge

0 signed · 73 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-2openalex-snapshot
Advances in Cryptology — CRYPTO’ 88
inferredcites →https://doi.org/10.1007/0-387-34799-2_21openalex-snapshot
Non-Interactive Zero-Knowledge with Preprocessing
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-44647-8_33openalex-snapshot
Robust Non-interactive Zero Knowledge
inferredcites →https://doi.org/10.1007/3-540-44647-8_4openalex-snapshot
Self Protecting Pirates and Black-Box Traitor Tracing
inferredcites →https://doi.org/10.1007/3-540-45539-6_30openalex-snapshot
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
inferredcites →https://doi.org/10.1007/3-540-47555-9_28openalex-snapshot
Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Preprocessing
inferredcites →https://doi.org/10.1007/3-540-48184-2openalex-snapshot
Advances in cryptology -- CRYPTO '87 : proceedings
inferredcites →https://doi.org/10.1007/3-540-48184-2_5openalex-snapshot
Non-Interactive Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1007/3-540-48405-1openalex-snapshot
Advances in Cryptology — CRYPTO’ 99
inferredcites →https://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
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_13openalex-snapshot
Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation
inferredcites →https://doi.org/10.1007/978-3-662-49896-5openalex-snapshot
Advances in Cryptology – EUROCRYPT 2016
inferredcites →https://doi.org/10.1007/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bfb0055102openalex-snapshot
Image density is complete for non-interactive-SZK
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/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0020-0190(90)90010-uopenalex-snapshot
A note on computational indistinguishability
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-4068(74)90037-8openalex-snapshot
Subjectivity and correlation in randomized strategies
inferredcites →https://doi.org/10.1017/cbo9780511546891openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1017/cbo9780511721656openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/ccc.1999.766262openalex-snapshot
Comparing entropies in statistical zero knowledge with applications to the structure of SZK
inferredcites →https://doi.org/10.1109/focs.2004.13openalex-snapshot
An Unconditional Study of Computational Zero Knowledge
inferredcites →https://doi.org/10.1109/fscs.1990.89549openalex-snapshot
Multiple non-interactive zero knowledge proofs based on a single random string
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.1989.63521openalex-snapshot
Minimum resource zero knowledge proofs
inferredcites →https://doi.org/10.1137/0220068openalex-snapshot
Noninteractive Zero-Knowledge
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/22145.22178openalex-snapshot
The knowledge complexity of interactive proof-systems
inferredcites →https://doi.org/10.1145/237814.238016openalex-snapshot
On relationships between statistical zero-knowledge proofs
inferredcites →https://doi.org/10.1145/288090.288108openalex-snapshot
An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products
inferredcites →https://doi.org/10.1145/509907.509980openalex-snapshot
Universally composable two-party and multi-party secure computation
inferredcites →https://doi.org/10.1145/62212.62215openalex-snapshot
Founding crytpography on oblivious transfer
inferredcites →https://doi.org/10.1145/62212.62222openalex-snapshot
Non-interactive zero-knowledge and its applications
inferredcites →https://doi.org/10.1145/636865.636868openalex-snapshot
A complete problem for statistical 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/11761679_21openalex-snapshot
Perfect Non-interactive Zero Knowledge for NP
inferred← citeshttps://doi.org/10.1007/11818175_16openalex-snapshot
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
inferred← citeshttps://doi.org/10.1007/978-3-030-16458-4_9openalex-snapshot
Non-interactive Zero Knowledge Proofs in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_24openalex-snapshot
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust
inferred← citeshttps://doi.org/10.1007/978-3-030-64375-1_20openalex-snapshot
NIZK from SNARG
inferred← citeshttps://doi.org/10.1007/978-3-030-65277-7_38openalex-snapshot
Dual-Mode NIZKs: Possibility and Impossibility Results for Property Transfer
inferred← citeshttps://doi.org/10.1007/978-3-030-75248-4_8openalex-snapshot
Single-to-Multi-theorem Transformations for Non-interactive Statistical Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_11openalex-snapshot
Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_21openalex-snapshot
Classically Verifiable NIZK for QMA with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-031-68394-7_2openalex-snapshot
Unconditionally Secure Quantum Commitments with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-031-68400-5_11openalex-snapshot
Amplification of Non-interactive Zero Knowledge, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-91092-0_13openalex-snapshot
Black-Box Constant-Round Secure 2PC with Succinct Communication
inferred← citeshttps://doi.org/10.1007/978-3-032-25336-1_11openalex-snapshot
Robust Non-interactive Zero-Knowledge Combiners
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_5openalex-snapshot
Non-trivial Zero-Knowledge Implies One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_6openalex-snapshot
Lower Bounds for Non-interactive Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_7openalex-snapshot
Perfect NIZK with Adaptive Soundness
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_28openalex-snapshot
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_19openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
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/978-3-662-53644-5_2openalex-snapshot
Interactive Oracle Proofs
inferred← citeshttps://doi.org/10.1007/s00037-016-0122-2openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
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-019-09324-0openalex-snapshot
Multi-theorem Preprocessing NIZKs from Lattices
inferred← citeshttps://doi.org/10.1007/s00145-023-09449-3openalex-snapshot
NIZK from SNARGs
inferred← citeshttps://doi.org/10.1109/ccc.2006.33openalex-snapshot
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00027openalex-snapshot
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
inferred← citeshttps://doi.org/10.1137/21m140729xopenalex-snapshot
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
inferred← citeshttps://doi.org/10.1145/2220357.2220358openalex-snapshot
New Techniques for Noninteractive Zero-Knowledge
inferred← citeshttps://doi.org/10.1145/3477139openalex-snapshot
Computing Blindfolded on Data Homomorphically Encrypted under Multiple Keys: A Survey
inferred← citeshttps://doi.org/10.1145/3564246.3585119openalex-snapshot
Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness
inferred← citeshttps://doi.org/10.1155/2014/560484openalex-snapshot
A Survey of Noninteractive Zero Knowledge Proof System and Its Applications
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1744openalex-snapshot
Increasing the power of the verifier in Quantum 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.