The Knowledge Complexity of Interactive Proof Systems (Q3833627): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Charles W. Rackoff / rank
Normal rank
 
Property / author
 
Property / author: Charles W. Rackoff / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970606468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for non-black-box zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definitions and properties of zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Composition of Zero-Knowledge Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which Languages Have 4-Round Zero-Knowledge Proofs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to construct constant-round zero-knowledge proof systems for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict polynomial-time in simulation and extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of 3-round zero-knowledge proof systems for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank

Latest revision as of 09:09, 20 June 2024

scientific article
Language Label Description Also known as
English
The Knowledge Complexity of Interactive Proof Systems
scientific article

    Statements

    The Knowledge Complexity of Interactive Proof Systems (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    interactive proof
    0 references
    quadratic residue
    0 references
    cryptography
    0 references
    zero-knowledge
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references