On the communication complexity of zero-knowledge proofs (Q1261016)

From MaRDI portal
Revision as of 02:48, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/joc/BoyarLP93, #quickstatements; #temporary_batch_1731547958265)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the communication complexity of zero-knowledge proofs
scientific article

    Statements

    title
    On the communication complexity of zero-knowledge proofs (English)
    0 references
    author
    René Peralta
    0 references
    Joan. Boyar
    0 references
    Carstent Lund
    0 references
    publication date
    29 August 1993
    0 references
    zbMATH Keywords
    cryptographic protocols
    0 references
    zero-knowledge proofs of knowledge
    0 references

    Identifiers

    DOI
    10.1007/BF02620135
    0 references
    Mathematics Subject Classification ID
    68Q30
    0 references
    68P25
    0 references
    94A60
    0 references
    zbMATH DE Number
    399376
    0 references
    Wikidata QID
    Q62472241
    0 references
    OpenAlex ID
    W2022025391
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1261016&oldid=37913596"
    Powered by MediaWiki