A classification of computational assumptions in the algebraic group model (Q2096519): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On instantiating the algebraic group model from falsifiable assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short signatures without random oracles and the SDH assumption in bilinear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation Results on the “One-More” Computational Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinction between fixed and random generators in group-based assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Uber-Assumption Family / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Déjà Q: Using Dual Systems to Revisit q-Type Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic remark on algebraic program testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic group model and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a classification of non-interactive computational assumptions in cyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Pairing-Based Non-interactive Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight reductions for Diffie-Hellman variants in the algebraic group model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a determinate algorithm for the discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log / rank
 
Normal rank

Latest revision as of 18:35, 30 July 2024

scientific article
Language Label Description Also known as
English
A classification of computational assumptions in the algebraic group model
scientific article

    Statements

    A classification of computational assumptions in the algebraic group model (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    algebraic group model
    0 references
    Boyen's Uber assumption
    0 references
    pairing-based cryptography
    0 references
    0 references
    0 references

    Identifiers