Round-optimal zero-knowledge proofs of knowledge for NP (Q362163): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11432-011-4379-4 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6199673 / rank
 
Normal rank
Property / zbMATH Keywords
 
zero-knowledge proofs
Property / zbMATH Keywords: zero-knowledge proofs / rank
 
Normal rank
Property / zbMATH Keywords
 
proofs of knowledge
Property / zbMATH Keywords: proofs of knowledge / rank
 
Normal rank
Property / zbMATH Keywords
 
black-box simulation
Property / zbMATH Keywords: black-box simulation / rank
 
Normal rank
Property / zbMATH Keywords
 
constant-round
Property / zbMATH Keywords: constant-round / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2257281123 / 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: 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: Q4318711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / 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: Definitions and properties of zero-knowledge proof systems / 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: On the Composition of Zero-Knowledge Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314040 / 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: Q4414268 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11432-011-4379-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Round-optimal zero-knowledge proofs of knowledge for NP
scientific article

    Statements

    Round-optimal zero-knowledge proofs of knowledge for NP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2013
    0 references
    zero-knowledge proofs
    0 references
    proofs of knowledge
    0 references
    black-box simulation
    0 references
    constant-round
    0 references

    Identifiers