High Parallel Complexity Graphs and Memory-Hard Functions

DOI10.1145/2746539.2746622zbMath1321.68374OpenAlexW2072573758MaRDI QIDQ2941555

Joël Alwen, Vladimir Serbinenko

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2746539.2746622

zbMATH Keywords

cryptographyparallelismpebblinggraph complexitymemory-hard functions

Mathematics Subject Classification ID

Related Items (21)

Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Cumulative Space in Black-White Pebbling and Resolution ⋮ Proof of Space from Stacked Expanders ⋮ Rifflescrambler -- a memory-hard password storing function ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Parallelizable delegation from LWE ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ The cost of adaptivity in security games on graphs ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Password hashing and preprocessing ⋮ Efficiently Computing Data-Independent Memory-Hard Functions ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity ⋮ Scrypt Is Maximally Memory-Hard

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: High Parallel Complexity Graphs and Memory-Hard Functions