Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Efficiently Computing Data-Independent Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-Robust Graphs and Their Cumulative Memory Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scrypt Is Maximally Memory-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cumulative Space in Black-White Pebbling and Resolution / 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: Data-independent memory hard functions: new attacks and stronger constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the depth-robustness and cumulative pebbling cost of Argon2i / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the standard pebble game and hard to pebble graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key-Evolution Schemes Resilient to Space-Bounded Leakage / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Time Computable Self-erasing Functions / 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: Bandwidth hard functions for ASIC resistance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:06, 3 December 2024

scientific article; zbMATH DE number 7835120
Language Label Description Also known as
English
Bandwidth-Hard Functions: Reductions and Lower Bounds
scientific article; zbMATH DE number 7835120

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references