Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems (Q3600393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of a determinate algorithm for the discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788591 / 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: A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems / rank
 
Normal rank

Latest revision as of 02:00, 29 June 2024

scientific article
Language Label Description Also known as
English
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
scientific article

    Statements

    Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 February 2009
    0 references
    0 references
    generic group model
    0 references
    straight-line programs
    0 references
    hardness conditions
    0 references
    lower bounds
    0 references
    0 references