On the public citation graph

Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP

0 signed · 43 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-39118-5_19openalex-snapshot

Collision Free Hash Functions and Public Key Signature Schemes

inferredcites →https://doi.org/10.1007/3-540-48071-4_28openalex-snapshot

On Defining Proofs of Knowledge

inferredcites →https://doi.org/10.1007/3-540-48329-2_22openalex-snapshot

On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures

inferredcites →https://doi.org/10.1007/bf02620230openalex-snapshot

A uniform-complexity treatment of encryption and zero-knowledge

inferredcites →https://doi.org/10.1007/bfb0020803openalex-snapshot

Computationally convincing proofs of knowledge

inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot

Probabilistic encryption

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/18.669255openalex-snapshot

Statistical secrecy and multibit commitments

inferredcites →https://doi.org/10.1109/sfcs.1989.63521openalex-snapshot

Minimum resource zero knowledge proofs

inferredcites →https://doi.org/10.1109/sfcs.1997.646126openalex-snapshot

Does parallel repetition lower the error in computationally sound protocols?

inferredcites →https://doi.org/10.1137/0218012openalex-snapshot

The Knowledge Complexity of Interactive Proof Systems

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/129712.129782openalex-snapshot

A note on efficient zero-knowledge proofs and arguments (extended abstract)

inferredcites →https://doi.org/10.1145/258533.258635openalex-snapshot

Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments

inferredcites →https://doi.org/10.1145/28395.28418openalex-snapshot

The complexity of perfect zero-knowledge

inferredcites →https://doi.org/10.7146/brics.v3i45.20047openalex-snapshot

Statistical Secrecy and Multi-Bit Commitments

inferredcites →https://doi.org/10.7146/brics.v4i50.19271openalex-snapshot

Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP

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-45539-6_30openalex-snapshot

Efficient Concurrent Zero-Knowledge in the Auxiliary String Model

inferred← citeshttps://doi.org/10.1007/3-540-48969-x_3openalex-snapshot

Commitment Schemes and Zero-Knowledge Protocols

inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_19openalex-snapshot

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence

inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_4openalex-snapshot

Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity

inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_24openalex-snapshot

Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions

inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_5openalex-snapshot

Parallel Repetition of Computationally Sound Protocols Revisited

inferred← citeshttps://doi.org/10.1007/978-3-540-88625-9_28openalex-snapshot

Publicly Verifiable Remote Data Integrity

inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_10openalex-snapshot

Distinguishing Distributions Using Chernoff Information

inferred← citeshttps://doi.org/10.1007/978-3-662-46497-7_9openalex-snapshot

Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence

inferred← citeshttps://doi.org/10.1007/bfb0055787openalex-snapshot

Timed bisimulation and open maps

inferred← citeshttps://doi.org/10.1007/s00145-010-9090-xopenalex-snapshot

Parallel Repetition of Computationally Sound Protocols Revisited

inferred← citeshttps://doi.org/10.1007/s001450010011openalex-snapshot

Short Non-Interactive Cryptographic Proofs

inferred← citeshttps://doi.org/10.1109/csf.2010.24openalex-snapshot

A Machine-Checked Formalization of Sigma-Protocols

inferred← citeshttps://doi.org/10.1109/focs.2009.50openalex-snapshot

A Parallel Repetition Theorem for Any Interactive Argument

inferred← citeshttps://doi.org/10.1145/2447712.2447731openalex-snapshot

Guest column

inferred← citeshttps://doi.org/10.7146/brics.v4i50.19271openalex-snapshot

Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP

inferred← citeshttps://doi.org/10.7146/brics.v4i51.19272openalex-snapshot

Some Lambda Calculus and Type Theory Formalized

inferred← citeshttps://doi.org/10.7146/brics.v4i52.19273openalex-snapshot

On the Finitary Characterization of pi-Congruences

inferred← citeshttps://doi.org/10.7146/brics.v4i53.19274openalex-snapshot

Online Type-Directed Partial Evaluation

inferred← citeshttps://doi.org/10.7146/brics.v5i1.19275openalex-snapshot

A Simple Solution to Type Specialization

inferred← citeshttps://doi.org/10.7146/brics.v5i3.19276openalex-snapshot

Comparison of Coding DNA

inferred← citeshttps://doi.org/10.7146/brics.v5i4.19277openalex-snapshot

Timed Bisimulation and Open Maps

inferred← citeshttps://doi.org/10.7146/brics.v5i6.19278openalex-snapshot

Further Results on Partial Order Equivalences on Infinite Systems

inferred← citeshttps://doi.org/10.7146/brics.v5i7.19279openalex-snapshot

Marked Ancestor Problems (Preliminary Version)

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.