Which languages have 4-round zero-knowledge proofs? (Q421047): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(10 intermediate revisions by 9 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-010-9081-y / rank
Normal rank
 
Property / author
 
Property / author: Jonathan N. Katz / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / 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: 6037991 / rank
 
Normal rank
Property / zbMATH Keywords
 
zero-knowledge proofs
Property / zbMATH Keywords: zero-knowledge proofs / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds
Property / zbMATH Keywords: lower bounds / rank
 
Normal rank
Property / author
 
Property / author: Jonathan N. Katz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-010-9081-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983179654 / rank
 
Normal rank
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: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / 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: Lower bounds for non-black-box zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750398 / 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: 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: Q4950056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-optimal perfect zero-knowledge proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of statistically hiding bit commitment schemes and fail-stop signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / 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: On the Composition of Zero-Knowledge 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: Definitions and properties of zero-knowledge proof systems / 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: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Equivalence Between Zero Knowledge and Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private Coins versus Public Coins in Zero-Knowledge Proof Systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-010-9081-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:04, 9 December 2024

scientific article
Language Label Description Also known as
English
Which languages have 4-round zero-knowledge proofs?
scientific article

    Statements

    Which languages have 4-round zero-knowledge proofs? (English)
    0 references
    23 May 2012
    0 references
    zero-knowledge proofs
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers