Efficient NIZKs for algebraic sets (Q6157547): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Disjunctions for Hash Proof Systems: New Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On QA-NIZK in the BPK Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Techniques for SPHFs and Efficient One-Round PAKE Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideals, Varieties, and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Framework for Diffie-Hellman Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Span Programs and Succinct NIZKs without PCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Zero-Knowledge Proofs for Circuit Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Zaps and New Techniques for NIZK / 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: Q4737161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying Zero-Knowledge Proofs of Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kernel Matrix Diffie-Hellman Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Linear Matrix Representations of Helton-Vinnikov Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability / rank
 
Normal rank

Latest revision as of 02:46, 1 August 2024

scientific article; zbMATH DE number 7684803
Language Label Description Also known as
English
Efficient NIZKs for algebraic sets
scientific article; zbMATH DE number 7684803

    Statements

    Efficient NIZKs for algebraic sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2023
    0 references
    algebraic branching programs
    0 references
    algebraic languages
    0 references
    algebraic sets
    0 references
    NIZK
    0 references
    pairing-based cryptography
    0 references
    SPHF
    0 references
    zero knowledge
    0 references

    Identifiers