Bandwidth-Hard Functions: Reductions and Lower Bounds

DOI10.1007/S00145-024-09497-3MaRDI QIDQ6489332

Peiyuan Liu, Jeremiah Blocki, Ling Ren, Samson Zhou

Publication date: 21 April 2024

Published in: Journal of Cryptology (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• A simplified NP-complete satisfiability problem
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Bandwidth hard functions for ASIC resistance
• Data-independent memory hard functions: new attacks and stronger constructions
• Inapproximability of the standard pebble game and hard to pebble graphs
• Efficiently Computing Data-Independent Memory-Hard Functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
• One-Time Computable Self-erasing Functions
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Cumulative Space in Black-White Pebbling and Resolution
• Key-Evolution Schemes Resilient to Space-Bounded Leakage
• Depth-Robust Graphs and Their Cumulative Memory Complexity
• Scrypt Is Maximally Memory-Hard

This page was built for publication: Bandwidth-Hard Functions: Reductions and Lower Bounds