Memory-hard functions from cryptographic primitives

DOI10.1007/978-3-030-26951-7_19OpenAlexW2968549319MaRDI QIDQ2304993

Stefano Tessaro, Binyi Chen

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_19

zbMATH Keywords

provable securityideal modelsmemory-hard functions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes

This page was built for publication: Memory-hard functions from cryptographic primitives