A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Why “Fiat-Shamir for Proofs” Lacks a Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random oracle methodology, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Coin Concurrent Zero-Knowledge in the Global Hash Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid commitments and their applications to zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Sigma-Protocols Non-interactive Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Signatures of Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved OR-Composition of Sigma-Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / 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: Q3789104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zaps 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: Strengthening zero-knowledge protocols using signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434875 / 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: The Knowledge Complexity of Interactive Proof Systems / 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: Efficient Non-interactive Proof Systems for Bilinear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Round-Optimal Zero Knowledge in the Bare Public-Key Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Zero Knowledge on the Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero Knowledge in the Random Oracle Model, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model / rank
 
Normal rank

Latest revision as of 19:02, 11 July 2024

scientific article
Language Label Description Also known as
English
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
scientific article

    Statements

    A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 April 2016
    0 references
    non-interactive zero-knowledge (NIZK)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers