NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/978-3-030-56877-1_26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3013660109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NIZK from LPN and trapdoor hash via correlation intractability for approximable relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir: from practice to theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir and correlation intractability from strong KDM-secure encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random oracle methodology, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoor hash functions and their applications / 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: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / 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: New Techniques for Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: From obfuscation to the security of Fiat-Shamir for proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use indistinguishability obfuscation / rank
 
Normal rank

Latest revision as of 01:15, 31 July 2024

scientific article
Language Label Description Also known as
English
NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
scientific article

    Statements

    NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2022
    0 references
    0 references
    zero-knowledge argument systems
    0 references
    search-complexity
    0 references
    0 references