On the public citation graph

Computationally convincing proofs of knowledge

https://doi.org/10.1007/bfb0020803
0 signed · 29 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/3-540-38424-3_7openalex-snapshot
One-Way Group Actions
inferredcites →https://doi.org/10.1007/3-540-46885-4_20openalex-snapshot
Sorting out zero-knowledge
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-47721-7_13openalex-snapshot
Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How
inferredcites →https://doi.org/10.1007/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
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/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
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/0304-3975(91)90259-5openalex-snapshot
Constant-round perfect zero-knowledge computationally convincing protocols
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/sfcs.1987.49openalex-snapshot
Random self-reducibility and zero knowledge interactive proofs of possession of information
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/122413.122414openalex-snapshot
How convincing is your protocol?
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.1007/3-540-46766-1_38openalex-snapshot
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_28openalex-snapshot
On Defining Proofs of Knowledge
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_21openalex-snapshot
Entity Authentication and Key Distribution
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_2openalex-snapshot
Proving Computational Ability
inferred← citeshttps://doi.org/10.1007/bf00207999openalex-snapshot
The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge
inferred← citeshttps://doi.org/10.1007/bfb0030871openalex-snapshot
On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
inferred← citeshttps://doi.org/10.1007/bfb0034844openalex-snapshot
A hidden cryptographic assumption in no-transferable indentification schemes
inferred← citeshttps://doi.org/10.1007/bfb0055101openalex-snapshot
Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP
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/s0304-3975(96)00277-0openalex-snapshot
Practical proofs of knowledge without relying on theoretical proofs of membership on languages
inferred← citeshttps://doi.org/10.1145/276698.276882openalex-snapshot
Robust efficient distributed RSA-key generation
inferred← citeshttps://doi.org/10.1145/277697.277779openalex-snapshot
Robust efficient distributed RSA-key generation
inferred← citeshttps://doi.org/10.70675/d240a5f6zc24dz43abz8b31zc586e211ca8eopenalex-snapshot
Non-interactive arguments of knowledge
inferred← citeshttps://doi.org/10.7146/brics.v4i50.19271openalex-snapshot
Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument 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.