The following pages link to Jeremiah Blocki (Q1648823):
Displaying 31 items.
- Sustained space complexity (Q1648824) (← links)
- On the depth-robustness and cumulative pebbling cost of Argon2i (Q1690203) (← links)
- DAHash: distribution aware tuning of password hashing costs (Q2147252) (← links)
- On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
- Data-independent memory hard functions: new attacks and stronger constructions (Q2304996) (← links)
- On the computational complexity of minimal cumulative cost graph pebbling (Q2656946) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Naturally Rehearsing Passwords (Q2867165) (← links)
- Differentially private data analysis of social networks via restricted sensitivity (Q2986861) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- Adaptive Regret Minimization in Bounded-Memory Games (Q3190039) (← links)
- Resolving the Complexity of Some Data Privacy Problems (Q3587455) (← links)
- (Q4638058) (← links)
- Audit Mechanisms for Provable Risk Management and Accountable Data Governance (Q4909428) (← links)
- Relaxed Locally Correctable Codes in Computationally Bounded Channels (Q5001794) (← links)
- (Q5002790) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- (Q5875706) (← links)
- (Q5875735) (← links)
- (Q6059376) (← links)
- (Q6107276) (← links)
- Cost-asymmetric memory hard password hashing (Q6134807) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions (Q6163949) (← links)
- The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs (Q6169348) (← links)
- Cost-asymmetric memory hard password hashing (Q6204165) (← links)
- On Explicit Constructions of Extremely Depth Robust Graphs (Q6379783) (← links)
- Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)
- Privately estimating graph parameters in sublinear time (Q6560812) (← links)
- On relaxed locally decodable codes for Hamming and insertion-deletion errors (Q6640349) (← links)
- How to make your approximation algorithm private: a black-box differentially-private transformation for tunable approximation algorithms of functions with low sensitivity (Q6663080) (← links)
