Bandwidth hard functions for ASIC resistance

DOI10.1007/978-3-319-70500-2_16MaRDI QIDQ1690204zbMATH OpenOpenAlexFDO

Authors Ling Ren, Srinivas Devadas

Publication date 19 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-70500-2_16

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficiently computing data-independent memory-hard functions
• Scrypt is maximally memory-hard
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Static-memory-hard functions, and modeling the cost of space vs. time
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks

Cited in

(6)

• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• PURED: a unified framework for resource-hard functions
• Trapdoor memory-hard functions
• Bandwidth-Hard Functions: Reductions and Lower Bounds
• CArrency: an energy-efficient proof-of-work scheme for crypto-currencies
• Static-memory-hard functions, and modeling the cost of space vs. time

This page was built for publication: Bandwidth hard functions for ASIC resistance

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