Moderately hard functions: definition, instantiations, and applications

DOI10.1007/978-3-319-70500-2_17zbMath1410.94038OpenAlexW2765443683MaRDI QIDQ1690205

Joël Alwen, Björn Tackmann

Publication date: 19 January 2018

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (5)

Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Permissionless consensus in the resource model ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ Turn-based communication channels

This page was built for publication: Moderately hard functions: definition, instantiations, and applications