On the communication complexity of zero-knowledge proofs (Q1261016): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62472241, #quickstatements; #temporary_batch_1712272666262
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3778673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic zero-knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete logarithm implementation of perfect zero-knowledge blobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Simulation of Boolean Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short propositional formulas represent nondeterministic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge proofs of identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02620135 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022025391 / rank
 
Normal rank

Latest revision as of 11:35, 30 July 2024

scientific article
Language Label Description Also known as
English
On the communication complexity of zero-knowledge proofs
scientific article

    Statements

    On the communication complexity of zero-knowledge proofs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 August 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    cryptographic protocols
    0 references
    zero-knowledge proofs of knowledge
    0 references
    0 references
    0 references