Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficiently Computing Data-Independent Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Parallel Complexity Graphs and Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache Based Remote Timing Attack on the AES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoff Cryptanalysis of Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-uniform Cracks in the Concrete: The Power of Free Precomputation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mitigating Dictionary Attacks on Password-Protected Local Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and Proofs of Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Publicly verifiable proofs of sequential work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank

Latest revision as of 19:27, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficiently Computing Data-Independent Memory-Hard Functions
scientific article

    Statements

    Identifiers