The Knowledge Complexity of Interactive Proof Systems
E17288
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
All labels observed (3)
How this entity was disambiguated
This entity first appeared as the object of triple T143822 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: The Knowledge Complexity of Interactive Proof Systems Context triple: [Shafi Goldwasser, notableWork, The Knowledge Complexity of Interactive Proof Systems]
-
A.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
B.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
C.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
D.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
E.
Science of Logic
Science of Logic is a foundational philosophical work by G.W.F. Hegel that systematically develops his dialectical method and metaphysical account of concepts, being, and reality.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: The Knowledge Complexity of Interactive Proof Systems Target entity description: "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
A.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
B.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
C.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
D.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
E.
Science of Logic
Science of Logic is a foundational philosophical work by G.W.F. Hegel that systematically develops his dialectical method and metaphysical account of concepts, being, and reality.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
scientific paper
ⓘ
theoretical computer science paper ⓘ |
| assumes |
existence of one-way functions
ⓘ
existence of pseudorandom generators ⓘ |
| author |
Charles Rackoff
ⓘ
Shafi Goldwasser ⓘ Silvio Micali ⓘ |
| citationStatus | highly cited ⓘ |
| coauthorRelationship | collaboration between Goldwasser, Micali, and Rackoff ⓘ |
| coreConcept |
completeness
ⓘ
probabilistic polynomial-time verifier ⓘ prover-verifier interaction ⓘ simulation paradigm ⓘ simulator for verifier’s view ⓘ soundness ⓘ |
| defines |
computational zero-knowledge
ⓘ
knowledge complexity of a proof system ⓘ perfect zero-knowledge ⓘ statistical zero-knowledge ⓘ zero-knowledge interactive proof ⓘ |
| field |
computational complexity theory
ⓘ
cryptography ⓘ theoretical computer science ⓘ |
| hasAuthorAffiliationAtTimeOfPublication | Massachusetts Institute of Technology ⓘ |
| impact |
basis for many cryptographic protocols
ⓘ
foundation of zero-knowledge proof theory ⓘ |
| influencedField |
complexity theory
ⓘ
modern cryptography ⓘ secure protocols ⓘ |
| introducedConcept |
knowledge complexity
ⓘ
zero-knowledge proof ⓘ |
| language | English ⓘ |
| publicationYear | 1985 ⓘ |
| publishedIn | Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing ⓘ |
| publisher | Association for Computing Machinery ⓘ |
| recognizedAs |
seminal paper in complexity theory
ⓘ
seminal paper in cryptography ⓘ |
| resultType | theoretical result ⓘ |
| shows | existence of zero-knowledge proofs for some NP problems under cryptographic assumptions ⓘ |
| studies |
information revealed by proofs
ⓘ
interactive proof systems ⓘ |
| subfield |
interactive proof systems
ⓘ
zero-knowledge proofs ⓘ |
| topic |
computational security
ⓘ
information-theoretic security ⓘ interactive proofs ⓘ zero-knowledge proofs ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: The Knowledge Complexity of Interactive Proof Systems Description of subject: "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: The Knowledge Complexity of Interactive Proof Systems
linked to: The Knowledge Complexity of Interactive Proof Systems