Sustained space complexity

DOI10.1007/978-3-319-78375-8_4zbMath1423.94045arXiv1705.05313OpenAlexW2616005523MaRDI QIDQ1648824

Jeremiah Blocki, Krzysztof Pietrzak, Joël Alwen

Publication date: 9 July 2018

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (9)

Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Parallelizable delegation from LWE ⋮ 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 ⋮ Unnamed Item ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Proofs of Catalytic Space

This page was built for publication: Sustained space complexity