scientific article; zbMATH DE number 7650384

DOI10.4230/LIPIcs.ITCS.2020.36MaRDI QIDQ5875735

Mohammad Hassan Ameri, Samson Zhou, Jeremiah Blocki

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1911.06790

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computationally data-independent memory hard functioncumulative memory complexitydynamic pebbling game

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Cost-asymmetric memory hard password hashing ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions ⋮ Cost-asymmetric memory hard password hashing

This page was built for publication: