Jeremiah Blocki

Available identifiers

zbMath Open blocki.jeremiahDBLP30/8037WikidataQ57515863 ScholiaQ57515863MaRDI QIDQ1648823

List of research outcomes

Publication	Date of Publication	Type
How to make your approximation algorithm private: a black-box differentially-private transformation for tunable approximation algorithms of functions with low sensitivity	2025-01-14	Paper
On relaxed locally decodable codes for Hamming and insertion-deletion errors	2024-11-19	Paper
Privately estimating graph parameters in sublinear time	2024-06-24	Paper
Bandwidth-Hard Functions: Reductions and Lower Bounds	2024-04-21	Paper
Cost-asymmetric memory hard password hashing	2024-03-27	Paper
https://portal.mardi4nfdi.de/entity/Q6059376	2023-11-02	Paper
The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs	2023-08-14	Paper
Cost-asymmetric memory hard password hashing	2023-07-25	Paper
Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes	2023-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q6107276	2023-07-03	Paper
Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions	2023-06-30	Paper
https://portal.mardi4nfdi.de/entity/Q5875735	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875706	2023-02-03	Paper
On the multi-user security of short Schnorr signatures with preprocessing	2022-08-30	Paper
DAHash: distribution aware tuning of password hashing costs	2022-06-22	Paper
On Explicit Constructions of Extremely Depth Robust Graphs	2021-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q5002790	2021-07-28	Paper
Relaxed Locally Correctable Codes in Computationally Bounded Channels	2021-07-23	Paper
On the computational complexity of minimal cumulative cost graph pebbling	2021-03-17	Paper
Data-independent memory hard functions: new attacks and stronger constructions	2020-03-09	Paper
Sustained space complexity	2018-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q4638058	2018-05-03	Paper
On the depth-robustness and cumulative pebbling cost of Argon2i	2018-01-19	Paper
Depth-Robust Graphs and Their Cumulative Memory Complexity	2017-06-23	Paper
Differentially private data analysis of social networks via restricted sensitivity	2017-05-16	Paper
Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond	2016-12-22	Paper
Efficiently Computing Data-Independent Memory-Hard Functions	2016-10-27	Paper
Adaptive Regret Minimization in Bounded-Memory Games	2014-09-15	Paper
Set Families with Low Pairwise Intersection	2014-04-17	Paper
Naturally Rehearsing Passwords	2013-12-10	Paper
Audit Mechanisms for Provable Risk Management and Accountable Data Governance	2013-03-13	Paper
Resolving the Complexity of Some Data Privacy Problems	2010-09-07	Paper

Research outcomes over time

This page was built for person: Jeremiah Blocki