Bandwidth-Hard Functions: Reductions and Lower Bounds

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

Authors: Jeremiah Blocki, Peiyuan Liu, Ling Ren, Samson Zhou 

Publication date: 21 April 2024

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

Recommendations

• Data-independent memory hard functions: new attacks and stronger constructions
• Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
• Scrypt is maximally memory-hard
• Efficiently computing data-independent memory-hard functions
• Sustained space complexity

Mathematics Subject Classification ID

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

Cites Work

• A simplified NP-complete satisfiability problem
• Title not available (Why is that?)
• One-time computable self-erasing functions
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Inapproximability of the standard pebble game and hard to pebble graphs
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Bandwidth hard functions for ASIC resistance
• Efficiently computing data-independent memory-hard functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• Cumulative space in black-white pebbling and resolution
• Depth-robust graphs and their cumulative memory complexity
• Scrypt is maximally memory-hard
• Key-evolution schemes resilient to space-bounded leakage
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Data-independent memory hard functions: new attacks and stronger constructions

Cited In (1)

• PURED: a unified framework for resource-hard functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489332)