Who Cited It

The Knowledge Complexity of Interactive Proof Systems

1989 · SIAM Journal on Computing · 3,291 citations · 12 from inside this corpus

Shafi Goldwasser, Silvio Micali, Charles Rackoff low

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

The Knowledge Complexity of Interactive Proof Systems (1989)The Knowledge Complexity of I…Advances and Open Problems in Federated Learning (2020)Advances and Open Problems in…Random oracles are practical (1993)Random oracles are practicalUniversally composable security: a new paradigm for cryptographic protocols (2001)Universally composable securi…Entanglement detection (2009)Entanglement detectionSecurity Arguments for Digital Signatures and Blind Signatures (2000)Security Arguments for Digita…Pors (2007)PorsEntity Authentication and Key Distribution (2007)Entity Authentication and Key…A Pseudorandom Generator from any One-way Function (1999)A Pseudorandom Generator from…Software protection and simulation on oblivious RAMs (1996)Software protection and simul…Divertible protocols and atomic proxy cryptography (1998)Divertible protocols and atom…Secure quantum key distribution with realistic devices (2020)Secure quantum key distributi…Security and Composition of Multiparty Cryptographic Protocols (2000)Security and Composition of M…
12 of 12 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.
this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

What cites it, inside the corpus

PaperYearCited
Advances and Open Problems in Federated Learning20205,383
Random oracles are practical19934,733
Universally composable security: a new paradigm for cryptographic protocols20013,340
Entanglement detection20092,447
Security Arguments for Digital Signatures and Blind Signatures20002,223
Pors20071,905
Entity Authentication and Key Distribution20071,764
A Pseudorandom Generator from any One-way Function19991,682
Software protection and simulation on oblivious RAMs19961,632
Divertible protocols and atomic proxy cryptography19981,578
Secure quantum key distribution with realistic devices20201,565
Security and Composition of Multiparty Cryptographic Protocols20001,424

Links

Download BibTeX · Download RIS · DOI · OpenAlex record

Topics

Cryptography and Data SecurityComputer Science
Complexity and Algorithms in GraphsComputer Science
Computability, Logic, AI AlgorithmsComputer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

  • supports3 author record(s) attached.
  • supports8 reference(s) recorded.
  • neutralThe DOI carries no year to check against.
  • supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:47+00:00.

sha256 a08467ae9504f237…