Pages that link to "Item:Q2941555"

The following pages link to High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555):

Displaying 20 items.

• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
• Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
• Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
• SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
• Password hashing and preprocessing (Q2056723) (← links)
• Rifflescrambler -- a memory-hard password storing function (Q2167756) (← links)
• The cost of adaptivity in security games on graphs (Q2697875) (← links)
• Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
• Proof of Space from Stacked Expanders (Q3179360) (← links)
• Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
• Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
• Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
• Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)
• PURED: a unified framework for resource-hard functions (Q6623350) (← links)
• Trapdoor memory-hard functions (Q6637334) (← links)
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
• On sequential functions and fine-grained cryptography (Q6652975) (← links)