A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Statistical zero-knowledge languages can be recognized in two rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does co-NP have short interactive proofs ? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of promise problems with applications to public-key cryptography / 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 / cites work
 
Property / cites work: Q5751927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank

Latest revision as of 18:45, 17 May 2024

scientific article
Language Label Description Also known as
English
A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
scientific article

    Statements

    A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (English)
    0 references
    0 references
    0 references
    0 references
    29 August 1993
    0 references
    0 references
    discrete logarithm
    0 references
    interactive proof system
    0 references
    perfect zero-knowledge
    0 references