On the memory-tightness of hashed ElGamal (Q2119004): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2724434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-tight reductions / 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: Memory-Tight Reductions for Practical Key Encapsulation Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Logarithm problem with preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Space Tradeoffs for Attacks against One-Way Functions and PRGs / 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: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory lower bounds of reductions revisited / rank
 
Normal rank

Latest revision as of 10:16, 28 July 2024

scientific article
Language Label Description Also known as
English
On the memory-tightness of hashed ElGamal
scientific article

    Statements

    Identifiers