Perfect Non-interactive Zero Knowledge for NP (Q3593105): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive and reusable non-malleable commitment schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmalleable Cryptography / 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: Q4434875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity and Knowledge Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Non-interactive Zero Knowledge for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient noninteractive zero-knowledge proof system for NP with general assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional Characterizations of Non-interactive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete problem for statistical zero knowledge / rank
 
Normal rank

Latest revision as of 10:12, 27 June 2024

scientific article
Language Label Description Also known as
English
Perfect Non-interactive Zero Knowledge for NP
scientific article

    Statements

    Perfect Non-interactive Zero Knowledge for NP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 September 2007
    0 references
    0 references
    Non-interactive zero-knowledge
    0 references
    universal composability
    0 references
    non-malleability
    0 references
    0 references