Pages that link to "Item:Q3000536"
From MaRDI portal
The following pages link to One-Time Computable Self-erasing Functions (Q3000536):
Displaying 12 items.
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Formalizing data deletion in the context of the right to be forgotten (Q2119018) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- Proofs of Space (Q3457086) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- Non-malleable Codes with Split-State Refresh (Q5738791) (← links)
- Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)
