Pages that link to "Item:Q2795993"
From MaRDI portal
The following pages link to Tradeoff Cryptanalysis of Memory-Hard Functions (Q2795993):
Displaying 14 items.
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Time-memory tradeoff attacks on the MTP proof-of-work scheme (Q1680219) (← links)
- Bandwidth hard functions for ASIC resistance (Q1690204) (← links)
- Symmetrically and asymmetrically hard cryptography (Q1701455) (← links)
- Disproving the conjectures from ``On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model'' (Q1705711) (← links)
- Data-independent memory hard functions: new attacks and stronger constructions (Q2304996) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- A New Algorithm for the Unbalanced Meet-in-the-Middle Problem (Q2958141) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs (Q5756640) (← links)
- Cost-asymmetric memory hard password hashing (Q6134807) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
