default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremiah Blocki
Person information
- affiliation: Purdue University, Department of Computer Science, West Lafayette, IN, USA
- affiliation (former): Microsoft Research, Cambridge, MA, USA
- affiliation (former, PhD 2014): Carnegie Mellon University, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j5]Wenjie Bai
, Jeremiah Blocki, Mohammad Hassan Ameri:
Cost-asymmetric memory hard password hashing. Inf. Comput. 297: 105134 (2024)- [j4]Jeremiah Blocki, Peiyuan Liu, Ling Ren, Samson Zhou:
Bandwidth-Hard Functions: Reductions and Lower Bounds. J. Cryptol. 37(2): 16 (2024) - [c60]Mohammad Hassan Ameri, Jeremiah Blocki:
Conditional Encryption with Applications to Secure Personalized Password Typo Correction. CCS 2024: 4643-4657 - [i64]Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee:
Differential privacy and Sublinear time are incompatible sometimes. CoRR abs/2407.07262 (2024) - [i63]Mohammad Hassan Ameri, Jeremiah Blocki:
Conditional Encryption with Applications to Secure Personalized Password Typo Correction. CoRR abs/2409.06128 (2024) - [i62]Jeremiah Blocki, Blake Holman, Seunghoon Lee:
The Impact of Reversibility on Parallel Pebbling. IACR Cryptol. ePrint Arch. 2024: 334 (2024) - [i61]Jeremiah Blocki, Seunghoon Lee:
A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function. IACR Cryptol. ePrint Arch. 2024: 1644 (2024) - 2023
- [c59]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou:
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. APPROX/RANDOM 2023: 59:1-59:24 - [c58]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CCC 2023: 14:1-14:25 - [c57]Jeremiah Blocki, Seunghoon Lee, Tamalika Mukherjee, Samson Zhou:
Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model. ICLR 2023 - [c56]Alexander R. Block, Jeremiah Blocki:
Computationally Relaxed Locally Decodable Codes, Revisited. ISIT 2023: 2714-2719 - [c55]Jeremiah Blocki, Peiyuan Liu:
Towards a Rigorous Statistical Analysis of Empirical Password Datasets. SP 2023: 606-625 - [c54]Peiyuan Liu, Jeremiah Blocki, Wenjie Bai:
Confident Monte Carlo: Rigorous Analysis of Guessing Curves for Probabilistic Password Models. SP 2023: 626-644 - [i60]Jeremiah Blocki, Seunghoon Lee, Tamalika Mukherjee, Samson Zhou:
Differentially Private L2-Heavy Hitters in the Sliding Window Model. CoRR abs/2302.11081 (2023) - [i59]Alexander R. Block, Jeremiah Blocki:
Computationally Relaxed Locally Decodable Codes, Revisited. CoRR abs/2305.01083 (2023) - 2022
- [j3]Jeremiah Blocki, Wuwei Zhang:
DALock: Password Distribution-Aware Throttling. Proc. Priv. Enhancing Technol. 2022(3): 516-537 (2022) - [c53]Jeremiah Blocki, Blake Holman:
Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions. CRYPTO (3) 2022: 222-251 - [c52]Jeremiah Blocki, Seunghoon Lee:
On the Multi-user Security of Short Schnorr Signatures with Preprocessing. EUROCRYPT (2) 2022: 614-643 - [c51]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Privately Estimating Graph Parameters in Sublinear Time. ICALP 2022: 26:1-26:19 - [c50]Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri:
Cost-Asymmetric Memory Hard Password Hashing. SCN 2022: 21-44 - [c49]Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki:
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. SCN 2022: 45-68 - [c48]Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, Jin Young Son:
On Explicit Constructions of Extremely Depth Robust Graphs. STACS 2022: 14:1-14:11 - [c47]Jeremiah Blocki, Blake Holman, Seunghoon Lee:
The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs. TCC (1) 2022: 52-79 - [i58]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Privately Estimating Graph Parameters in Sublinear time. CoRR abs/2202.05776 (2022) - [i57]Aiping Xiong, Chuhao Wu, Tianhao Wang, Robert W. Proctor, Jeremiah Blocki, Ninghui Li, Somesh Jha:
Using Illustrations to Communicate Differential Privacy Trust Models: An Investigation of Users' Comprehension, Perception, and Data Sharing Decision. CoRR abs/2202.10014 (2022) - [i56]Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri:
Cost-Asymmetric Memory Hard Password Hashing. CoRR abs/2206.12970 (2022) - [i55]Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CoRR abs/2209.08688 (2022) - [i54]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou:
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. CoRR abs/2210.03831 (2022) - [i53]Jeremiah Blocki, Blake Holman:
Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2022: 832 (2022) - [i52]Jeremiah Blocki, Blake Holman, Seunghoon Lee:
The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs. IACR Cryptol. ePrint Arch. 2022: 1503 (2022) - 2021
- [j2]Benjamin Harsha, Robert Morton, Jeremiah Blocki, John A. Springer, Melissa Dark:
Bicycle attacks considered harmful: Quantifying the damage of widespread password length leakage. Comput. Secur. 100: 102068 (2021) - [j1]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Trans. Inf. Theory 67(7): 4338-4360 (2021) - [c46]Jeremiah Blocki, Seunghoon Lee, Samson Zhou:
On the Security of Proofs of Sequential Work in a Post-Quantum World. ITC 2021: 22:1-22:27 - [c45]Wenjie Bai, Jeremiah Blocki:
DAHash: Distribution Aware Tuning of Password Hashing Costs. Financial Cryptography (2) 2021: 382-405 - [c44]Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS 2021: 739-750 - [c43]Wenjie Bai, Jeremiah Blocki, Benjamin Harsha:
Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking. GameSec 2021: 334-353 - [c42]Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni:
HACCLE: metaprogramming for secure multi-party computation. GPCE 2021: 130-143 - [c41]Jeremiah Blocki, Mike Cinkoske:
A New Connection Between Node and Edge Depth Robust Graphs. ITCS 2021: 64:1-64:18 - [c40]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Differentially-Private Sublinear-Time Clustering. ISIT 2021: 332-337 - [c39]Alexander R. Block, Jeremiah Blocki:
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. ISIT 2021: 1841-1846 - [i51]Wenjie Bai, Jeremiah Blocki:
DAHash: Distribution Aware Tuning of Password Hashing Costs. CoRR abs/2101.10374 (2021) - [i50]Alexander R. Block, Jeremiah Blocki:
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. CoRR abs/2103.14122 (2021) - [i49]Jeremiah Blocki, Peiyuan Liu:
Towards a Rigorous Statistical Analysis of Empirical Password Datasets. CoRR abs/2105.14170 (2021) - [i48]Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, Jin Young Son:
On Explicit Constructions of Extremely Depth Robust Graphs. CoRR abs/2110.04190 (2021) - [i47]Jeremiah Blocki, Seunghoon Lee:
Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs. CoRR abs/2110.04191 (2021) - [i46]Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. CoRR abs/2111.01060 (2021) - [i45]Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Differentially-Private Sublinear-Time Clustering. CoRR abs/2112.13751 (2021) - [i44]Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki:
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. IACR Cryptol. ePrint Arch. 2021: 801 (2021) - 2020
- [c38]Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu:
Locally Decodable/Correctable Codes for Insertions and Deletions. FSTTCS 2020: 16:1-16:17 - [c37]Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou:
On Locally Decodable Codes in Resource Bounded Channels. ITC 2020: 16:1-16:23 - [c36]Jeremiah Blocki, Seunghoon Lee, Samson Zhou:
Approximating Cumulative Pebbling Cost Is Unique Games Hard. ITCS 2020: 13:1-13:27 - [c35]Mohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou:
Computationally Data-Independent Memory Hard Functions. ITCS 2020: 36:1-36:28 - [i43]Benjamin Harsha, Robert Morton, Jeremiah Blocki, John A. Springer, Melissa Dark:
Bicycle Attacks Considered Harmful: Quantifying the Damage of Widespread Password Length Leakage. CoRR abs/2002.01513 (2020) - [i42]Benjamin Harsha, Jeremiah Blocki:
An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers. CoRR abs/2005.05911 (2020) - [i41]Jeremiah Blocki, Wuwei Zhang:
DALock: Distribution Aware Password Throttling. CoRR abs/2005.09039 (2020) - [i40]Jeremiah Blocki, Benjamin Harsha, Samson Zhou:
On the Economics of Offline Password Cracking. CoRR abs/2006.05023 (2020) - [i39]Jeremiah Blocki, Seunghoon Lee, Samson Zhou:
On the Security of Proofs of Sequential Work in a Post-Quantum World. CoRR abs/2006.10972 (2020) - [i38]Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni:
HACCLE: An Ecosystem for Building Secure Multi-Party Computations. CoRR abs/2009.01489 (2020) - [i37]Wenjie Bai, Jeremiah Blocki, Benjamin Harsha:
Information Signaling: A Counter-Intuitive Defense Against Password Cracking. CoRR abs/2009.10060 (2020) - [i36]Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu:
Locally Decodable/Correctable Codes for Insertions and Deletions. CoRR abs/2010.11989 (2020)
2010 – 2019
- 2019
- [c34]Jeremiah Blocki, Benjamin Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, Samson Zhou:
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. CRYPTO (2) 2019: 573-607 - [c33]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. ISIT 2019: 2414-2418 - [i35]Jeremiah Blocki, Seunghoon Lee, Samson Zhou:
Approximating Cumulative Pebbling Cost is Unique Games Hard. CoRR abs/1904.08078 (2019) - [i34]Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou:
On Locally Decodable Codes in Resource Bounded Channels. CoRR abs/1909.11245 (2019) - [i33]Jeremiah Blocki, Mike Cinkoske:
A New Connection Between Node and Edge Depth Robust Graphs. CoRR abs/1910.08920 (2019) - [i32]Mohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou:
Computationally Data-Independent Memory Hard Functions. CoRR abs/1911.06790 (2019) - [i31]Jeremiah Blocki, Seunghoon Lee:
On the Multi-User Security of Short Schnorr Signatures. IACR Cryptol. ePrint Arch. 2019: 1105 (2019) - 2018
- [c32]Jeremiah Blocki, Ling Ren, Samson Zhou:
Bandwidth-Hard Functions: Reductions and Lower Bounds. CCS 2018: 1820-1836 - [c31]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Sustained Space Complexity. EUROCRYPT (2) 2018: 99-130 - [c30]Benjamin Harsha, Jeremiah Blocki:
Just In Time Hashing. EuroS&P 2018: 368-383 - [c29]Jeremiah Blocki, Samson Zhou:
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. Financial Cryptography 2018: 329-346 - [c28]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. ICALP 2018: 106:1-106:4 - [c27]Jeremiah Blocki, Benjamin Harsha, Samson Zhou:
On the Economics of Offline Password Cracking. IEEE Symposium on Security and Privacy 2018: 853-871 - [i30]Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. CoRR abs/1803.05652 (2018) - [i29]Benjamin Harsha, Jeremiah Blocki:
Just in Time Hashing. IACR Cryptol. ePrint Arch. 2018: 112 (2018) - [i28]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Sustained Space Complexity. IACR Cryptol. ePrint Arch. 2018: 147 (2018) - [i27]Jeremiah Blocki, Ling Ren, Samson Zhou:
Bandwidth-Hard Functions: Reductions and Lower Bounds. IACR Cryptol. ePrint Arch. 2018: 221 (2018) - [i26]Jeremiah Blocki, Benjamin Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, Samson Zhou:
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. IACR Cryptol. ePrint Arch. 2018: 944 (2018) - 2017
- [c26]Joël Alwen, Jeremiah Blocki, Benjamin Harsha:
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. CCS 2017: 1001-1017 - [c25]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Depth-Robust Graphs and Their Cumulative Memory Complexity. EUROCRYPT (3) 2017: 3-32 - [c24]Joël Alwen, Jeremiah Blocki:
Towards Practical Attacks on Argon2i and Balloon Hashing. EuroS&P 2017: 142-157 - [c23]Jeremiah Blocki, Manuel Blum, Anupam Datta, Santosh S. Vempala:
Towards Human Computable Passwords. ITCS 2017: 10:1-10:47 - [c22]Jeremiah Blocki, Samson Zhou:
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. TCC (1) 2017: 445-465 - [c21]Tianhao Wang, Jeremiah Blocki, Ninghui Li, Somesh Jha:
Locally Differentially Private Protocols for Frequency Estimation. USENIX Security Symposium 2017: 729-745 - [i25]Tianhao Wang, Jeremiah Blocki, Ninghui Li, Somesh Jha:
Optimizing Locally Differentially Private Protocols. CoRR abs/1705.04421 (2017) - [i24]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Sustained Space Complexity. CoRR abs/1705.05313 (2017) - [i23]Jeremiah Blocki, Samson Zhou:
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. IACR Cryptol. ePrint Arch. 2017: 442 (2017) - [i22]Joël Alwen, Jeremiah Blocki, Benjamin Harsha:
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2017: 443 (2017) - 2016
- [c20]Jeremiah Blocki, Anirudh Sridhar:
Client-CASH: Protecting Master Passwords against Offline Attacks. AsiaCCS 2016: 165-176 - [c19]Joël Alwen, Jeremiah Blocki:
Efficiently Computing Data-Independent Memory-Hard Functions. CRYPTO (2) 2016: 241-271 - [c18]Jeremiah Blocki, Anupam Datta:
CASH: A Cost Asymmetric Secure Hash Algorithm for Optimal Password Protection. CSF 2016: 371-386 - [c17]Jeremiah Blocki, Anupam Datta, Joseph Bonneau:
Differentially Private Password Frequency Lists. NDSS 2016 - [c16]Jeremiah Blocki, Hong-Sheng Zhou:
Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond. TCC (B2) 2016: 517-546 - [i21]Jeremiah Blocki, Anirudh Sridhar:
Client-CASH: Protecting Master Passwords against Offline Attacks. CoRR abs/1603.00913 (2016) - [i20]Jeremiah Blocki, Samson Zhou:
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. CoRR abs/1609.04449 (2016) - [i19]Joël Alwen, Jeremiah Blocki:
Efficiently Computing Data-Independent Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2016: 115 (2016) - [i18]Jeremiah Blocki, Hong-Sheng Zhou:
Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond. IACR Cryptol. ePrint Arch. 2016: 145 (2016) - [i17]Jeremiah Blocki, Anupam Datta, Joseph Bonneau:
Differentially Private Password Frequency Lists. IACR Cryptol. ePrint Arch. 2016: 153 (2016) - [i16]Joël Alwen, Jeremiah Blocki:
Towards Practical Attacks on Argon2i and Balloon Hashing. IACR Cryptol. ePrint Arch. 2016: 759 (2016) - [i15]Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak:
Depth-Robust Graphs and Their Cumulative Memory Complexity. IACR Cryptol. ePrint Arch. 2016: 875 (2016) - 2015
- [c15]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha:
Audit Games with Multiple Defender Resources. AAAI 2015: 791-797 - [c14]Jeremiah Blocki, Saranga Komanduri, Lorrie Faith Cranor, Anupam Datta:
Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords. NDSS 2015 - [i14]Jeremiah Blocki, Anupam Datta:
CASH: A Cost Asymmetric Secure Hash Algorithm for Optimal Password Protection. CoRR abs/1509.00239 (2015) - [i13]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Naturally Rehearsing Passwords. IACR Cryptol. ePrint Arch. 2015: 166 (2015) - 2014
- [i12]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Human Computable Passwords. CoRR abs/1404.0024 (2014) - [i11]Calvin Beideman, Jeremiah Blocki:
Set Families with Low Pairwise Intersection. CoRR abs/1404.4622 (2014) - [i10]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha:
Audit Games with Multiple Defender Resources. CoRR abs/1409.4503 (2014) - [i9]Jeremiah Blocki, Saranga Komanduri, Lorrie Faith Cranor, Anupam Datta:
Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords. CoRR abs/1410.1490 (2014) - 2013
- [c13]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Naturally Rehearsing Passwords. ASIACRYPT (2) 2013: 361-380 - [c12]Jeremiah Blocki, Manuel Blum, Anupam Datta:
GOTCHA password hackers! AISec 2013: 25-34 - [c11]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha:
Adaptive Regret Minimization in Bounded-Memory Games. GameSec 2013: 65-84 - [c10]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha:
Audit Games. IJCAI 2013: 41-47 - [c9]Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet:
Differentially private data analysis of social networks via restricted sensitivity. ITCS 2013: 87-96 - [c8]Jeremiah Blocki, Saranga Komanduri, Ariel D. Procaccia, Or Sheffet:
Optimizing password composition policies. EC 2013: 105-122 - [i8]Jeremiah Blocki, Saranga Komanduri, Ariel D. Procaccia, Or Sheffet:
Optimizing Password Composition Policies. CoRR abs/1302.5101 (2013) - [i7]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Naturally Rehearsing Passwords. CoRR abs/1302.5122 (2013) - [i6]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha:
Audit Games. CoRR abs/1303.0356 (2013) - [i5]Jeremiah Blocki, Manuel Blum, Anupam Datta:
GOTCHA Password Hackers! CoRR abs/1310.1137 (2013) - 2012
- [c7]Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet:
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy. FOCS 2012: 410-419 - [c6]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha:
Audit Mechanisms for Provable Risk Management and Accountable Data Governance. GameSec 2012: 38-59 - [i4]Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet:
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy. CoRR abs/1204.2136 (2012) - [i3]Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet:
Differentially Private Data Analysis of Social Networks via Restricted Sensitivity. CoRR abs/1208.4586 (2012) - 2011
- [c5]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha:
Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection. CSF 2011: 312-327 - [c4]Anupam Datta, Jeremiah Blocki, Nicolas Christin, Henry DeYoung, Deepak Garg, Limin Jia, Dilsun Kirli Kaynar, Arunesh Sinha:
Understanding and Protecting Privacy: Formal Semantics and Principled Audit Mechanisms. ICISS 2011: 1-27 - [c3]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha:
Audit Mechanisms for Privacy Protection in Healthcare Environments. HealthSec 2011 - [c2]Steve Hanna, Rolf Rolles, Andres Molina-Markham, Pongsin Poosankam, Jeremiah Blocki, Kevin Fu, Dawn Song:
Take Two Software Updates and See Me in the Morning: The Case for Software Security Evaluations of Medical Devices. HealthSec 2011 - [i2]Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha:
Adaptive Regret Minimization in Bounded-Memory Games. CoRR abs/1111.2888 (2011) - 2010
- [c1]Jeremiah Blocki, Ryan Williams:
Resolving the Complexity of Some Data Privacy Problems. ICALP (2) 2010: 393-404 - [i1]Jeremiah Blocki, Ryan Williams:
Resolving the Complexity of Some Data Privacy Problems. CoRR abs/1004.3811 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
