Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/116825.116852 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011112377 / 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: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of 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: Definitions and properties of zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-round perfect zero-knowledge computationally convincing protocols / 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: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions / 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: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-round zero knowledge and proof auditors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zaps and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826476 / rank
 
Normal rank

Latest revision as of 17:24, 22 May 2024

scientific article; zbMATH DE number 622332
Language Label Description Also known as
English
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
scientific article; zbMATH DE number 622332

    Statements

    Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    information hiding
    0 references
    zero-knowledge proofs
    0 references
    secure encryption
    0 references
    graph isomorphism
    0 references
    graph nonisomorphism
    0 references
    interactive proofs
    0 references
    0 references
    0 references