BibTeX records: Jeremiah Blocki

download as .bib file

@article{DBLP:journals/iandc/BaiBA24,
  author       = {Wenjie Bai and
                  Jeremiah Blocki and
                  Mohammad Hassan Ameri},
  title        = {Cost-asymmetric memory hard password hashing},
  journal      = {Inf. Comput.},
  volume       = {297},
  pages        = {105134},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.ic.2023.105134},
  doi          = {10.1016/J.IC.2023.105134},
  timestamp    = {Tue, 18 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/BaiBA24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BlockiLRZ24,
  author       = {Jeremiah Blocki and
                  Peiyuan Liu and
                  Ling Ren and
                  Samson Zhou},
  title        = {Bandwidth-Hard Functions: Reductions and Lower Bounds},
  journal      = {J. Cryptol.},
  volume       = {37},
  number       = {2},
  pages        = {16},
  year         = {2024},
  url          = {https://doi.org/10.1007/s00145-024-09497-3},
  doi          = {10.1007/S00145-024-09497-3},
  timestamp    = {Tue, 19 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/joc/BlockiLRZ24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-07262,
  author       = {Jeremiah Blocki and
                  Hendrik Fichtenberger and
                  Elena Grigorescu and
                  Tamalika Mukherjee},
  title        = {Differential privacy and Sublinear time are incompatible sometimes},
  journal      = {CoRR},
  volume       = {abs/2407.07262},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2407.07262},
  doi          = {10.48550/ARXIV.2407.07262},
  eprinttype    = {arXiv},
  eprint       = {2407.07262},
  timestamp    = {Fri, 16 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2407-07262.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiHL24,
  author       = {Jeremiah Blocki and
                  Blake Holman and
                  Seunghoon Lee},
  title        = {The Impact of Reversibility on Parallel Pebbling},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {334},
  year         = {2024},
  url          = {https://eprint.iacr.org/2024/334},
  timestamp    = {Mon, 18 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiHL24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlockiGMZ23,
  author       = {Jeremiah Blocki and
                  Elena Grigorescu and
                  Tamalika Mukherjee and
                  Samson Zhou},
  editor       = {Nicole Megow and
                  Adam D. Smith},
  title        = {How to Make Your Approximation Algorithm Private: {A} Black-Box Differentially-Private
                  Transformation for Tunable Approximation Algorithms of Functions with
                  Low Sensitivity},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
                  Georgia, {USA}},
  series       = {LIPIcs},
  volume       = {275},
  pages        = {59:1--59:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.59},
  doi          = {10.4230/LIPICS.APPROX/RANDOM.2023.59},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BlockiGMZ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlockBCG0ZZ23,
  author       = {Alexander R. Block and
                  Jeremiah Blocki and
                  Kuan Cheng and
                  Elena Grigorescu and
                  Xin Li and
                  Yu Zheng and
                  Minshen Zhu},
  editor       = {Amnon Ta{-}Shma},
  title        = {On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion
                  Errors},
  booktitle    = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
                  2023, Warwick, {UK}},
  series       = {LIPIcs},
  volume       = {264},
  pages        = {14:1--14:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2023.14},
  doi          = {10.4230/LIPICS.CCC.2023.14},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/BlockBCG0ZZ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/BlockiLMZ23,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee and
                  Tamalika Mukherjee and
                  Samson Zhou},
  title        = {Differentially Private {\textdollar}L{\_}2{\textdollar}-Heavy Hitters
                  in the Sliding Window Model},
  booktitle    = {The Eleventh International Conference on Learning Representations,
                  {ICLR} 2023, Kigali, Rwanda, May 1-5, 2023},
  publisher    = {OpenReview.net},
  year         = {2023},
  url          = {https://openreview.net/forum?id=3UHoYrglYkG},
  timestamp    = {Wed, 24 Jul 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iclr/BlockiLMZ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/BlockB23,
  author       = {Alexander R. Block and
                  Jeremiah Blocki},
  title        = {Computationally Relaxed Locally Decodable Codes, Revisited},
  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2023,
                  Taipei, Taiwan, June 25-30, 2023},
  pages        = {2714--2719},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/ISIT54713.2023.10206655},
  doi          = {10.1109/ISIT54713.2023.10206655},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isit/BlockB23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sp/BlockiL23,
  author       = {Jeremiah Blocki and
                  Peiyuan Liu},
  title        = {Towards a Rigorous Statistical Analysis of Empirical Password Datasets},
  booktitle    = {44th {IEEE} Symposium on Security and Privacy, {SP} 2023, San Francisco,
                  CA, USA, May 21-25, 2023},
  pages        = {606--625},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/SP46215.2023.10179431},
  doi          = {10.1109/SP46215.2023.10179431},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sp/BlockiL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sp/LiuBB23,
  author       = {Peiyuan Liu and
                  Jeremiah Blocki and
                  Wenjie Bai},
  title        = {Confident Monte Carlo: Rigorous Analysis of Guessing Curves for Probabilistic
                  Password Models},
  booktitle    = {44th {IEEE} Symposium on Security and Privacy, {SP} 2023, San Francisco,
                  CA, USA, May 21-25, 2023},
  pages        = {626--644},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/SP46215.2023.10179365},
  doi          = {10.1109/SP46215.2023.10179365},
  timestamp    = {Thu, 27 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sp/LiuBB23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11081,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee and
                  Tamalika Mukherjee and
                  Samson Zhou},
  title        = {Differentially Private L\({}_{\mbox{2}}\)-Heavy Hitters in the Sliding
                  Window Model},
  journal      = {CoRR},
  volume       = {abs/2302.11081},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2302.11081},
  doi          = {10.48550/ARXIV.2302.11081},
  eprinttype    = {arXiv},
  eprint       = {2302.11081},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-11081.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01083,
  author       = {Alexander R. Block and
                  Jeremiah Blocki},
  title        = {Computationally Relaxed Locally Decodable Codes, Revisited},
  journal      = {CoRR},
  volume       = {abs/2305.01083},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2305.01083},
  doi          = {10.48550/ARXIV.2305.01083},
  eprinttype    = {arXiv},
  eprint       = {2305.01083},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2305-01083.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/popets/BlockiZ22,
  author       = {Jeremiah Blocki and
                  Wuwei Zhang},
  title        = {DALock: Password Distribution-Aware Throttling},
  journal      = {Proc. Priv. Enhancing Technol.},
  volume       = {2022},
  number       = {3},
  pages        = {516--537},
  year         = {2022},
  url          = {https://doi.org/10.56553/popets-2022-0084},
  doi          = {10.56553/POPETS-2022-0084},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/popets/BlockiZ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BlockiH22,
  author       = {Jeremiah Blocki and
                  Blake Holman},
  editor       = {Yevgeniy Dodis and
                  Thomas Shrimpton},
  title        = {Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent
                  Memory-Hard Functions},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2022 - 42nd Annual International
                  Cryptology Conference, {CRYPTO} 2022, Santa Barbara, CA, USA, August
                  15-18, 2022, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {13509},
  pages        = {222--251},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-15982-4\_8},
  doi          = {10.1007/978-3-031-15982-4\_8},
  timestamp    = {Sun, 13 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/crypto/BlockiH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/BlockiL22,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee},
  editor       = {Orr Dunkelman and
                  Stefan Dziembowski},
  title        = {On the Multi-user Security of Short Schnorr Signatures with Preprocessing},
  booktitle    = {Advances in Cryptology - {EUROCRYPT} 2022 - 41st Annual International
                  Conference on the Theory and Applications of Cryptographic Techniques,
                  Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {13276},
  pages        = {614--643},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-07085-3\_21},
  doi          = {10.1007/978-3-031-07085-3\_21},
  timestamp    = {Thu, 02 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/eurocrypt/BlockiL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlockiGM22,
  author       = {Jeremiah Blocki and
                  Elena Grigorescu and
                  Tamalika Mukherjee},
  editor       = {Mikolaj Bojanczyk and
                  Emanuela Merelli and
                  David P. Woodruff},
  title        = {Privately Estimating Graph Parameters in Sublinear Time},
  booktitle    = {49th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2022, July 4-8, 2022, Paris, France},
  series       = {LIPIcs},
  volume       = {229},
  pages        = {26:1--26:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2022.26},
  doi          = {10.4230/LIPICS.ICALP.2022.26},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BlockiGM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scn/BaiBA22,
  author       = {Wenjie Bai and
                  Jeremiah Blocki and
                  Mohammad Hassan Ameri},
  editor       = {Clemente Galdi and
                  Stanislaw Jarecki},
  title        = {Cost-Asymmetric Memory Hard Password Hashing},
  booktitle    = {Security and Cryptography for Networks - 13th International Conference,
                  {SCN} 2022, Amalfi, Italy, September 12-14, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13409},
  pages        = {21--44},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-14791-3\_2},
  doi          = {10.1007/978-3-031-14791-3\_2},
  timestamp    = {Sat, 10 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/scn/BaiBA22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scn/AmeriBB22,
  author       = {Mohammad Hassan Ameri and
                  Alexander R. Block and
                  Jeremiah Blocki},
  editor       = {Clemente Galdi and
                  Stanislaw Jarecki},
  title        = {Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard
                  Functions and Resource-Bounded Locally Decodable Codes},
  booktitle    = {Security and Cryptography for Networks - 13th International Conference,
                  {SCN} 2022, Amalfi, Italy, September 12-14, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13409},
  pages        = {45--68},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-14791-3\_3},
  doi          = {10.1007/978-3-031-14791-3\_3},
  timestamp    = {Sat, 10 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/scn/AmeriBB22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BlockiCLS22,
  author       = {Jeremiah Blocki and
                  Mike Cinkoske and
                  Seunghoon Lee and
                  Jin Young Son},
  editor       = {Petra Berenbrink and
                  Benjamin Monmege},
  title        = {On Explicit Constructions of Extremely Depth Robust Graphs},
  booktitle    = {39th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {219},
  pages        = {14:1--14:11},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2022.14},
  doi          = {10.4230/LIPICS.STACS.2022.14},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BlockiCLS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BlockiHL22,
  author       = {Jeremiah Blocki and
                  Blake Holman and
                  Seunghoon Lee},
  editor       = {Eike Kiltz and
                  Vinod Vaikuntanathan},
  title        = {The Parallel Reversible Pebbling Game: Analyzing the Post-quantum
                  Security of iMHFs},
  booktitle    = {Theory of Cryptography - 20th International Conference, {TCC} 2022,
                  Chicago, IL, USA, November 7-10, 2022, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {13747},
  pages        = {52--79},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-22318-1\_3},
  doi          = {10.1007/978-3-031-22318-1\_3},
  timestamp    = {Sun, 25 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/BlockiHL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05776,
  author       = {Jeremiah Blocki and
                  Elena Grigorescu and
                  Tamalika Mukherjee},
  title        = {Privately Estimating Graph Parameters in Sublinear time},
  journal      = {CoRR},
  volume       = {abs/2202.05776},
  year         = {2022},
  url          = {https://arxiv.org/abs/2202.05776},
  eprinttype    = {arXiv},
  eprint       = {2202.05776},
  timestamp    = {Fri, 18 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-05776.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-10014,
  author       = {Aiping Xiong and
                  Chuhao Wu and
                  Tianhao Wang and
                  Robert W. Proctor and
                  Jeremiah Blocki and
                  Ninghui Li and
                  Somesh Jha},
  title        = {Using Illustrations to Communicate Differential Privacy Trust Models:
                  An Investigation of Users' Comprehension, Perception, and Data Sharing
                  Decision},
  journal      = {CoRR},
  volume       = {abs/2202.10014},
  year         = {2022},
  url          = {https://arxiv.org/abs/2202.10014},
  eprinttype    = {arXiv},
  eprint       = {2202.10014},
  timestamp    = {Tue, 01 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-10014.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-12970,
  author       = {Wenjie Bai and
                  Jeremiah Blocki and
                  Mohammad Hassan Ameri},
  title        = {Cost-Asymmetric Memory Hard Password Hashing},
  journal      = {CoRR},
  volume       = {abs/2206.12970},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2206.12970},
  doi          = {10.48550/ARXIV.2206.12970},
  eprinttype    = {arXiv},
  eprint       = {2206.12970},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2206-12970.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-08688,
  author       = {Alexander R. Block and
                  Jeremiah Blocki and
                  Kuan Cheng and
                  Elena Grigorescu and
                  Xin Li and
                  Yu Zheng and
                  Minshen Zhu},
  title        = {On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion
                  Errors},
  journal      = {CoRR},
  volume       = {abs/2209.08688},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2209.08688},
  doi          = {10.48550/ARXIV.2209.08688},
  eprinttype    = {arXiv},
  eprint       = {2209.08688},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2209-08688.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-03831,
  author       = {Jeremiah Blocki and
                  Elena Grigorescu and
                  Tamalika Mukherjee and
                  Samson Zhou},
  title        = {How to Make Your Approximation Algorithm Private: {A} Black-Box Differentially-Private
                  Transformation for Tunable Approximation Algorithms of Functions with
                  Low Sensitivity},
  journal      = {CoRR},
  volume       = {abs/2210.03831},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.03831},
  doi          = {10.48550/ARXIV.2210.03831},
  eprinttype    = {arXiv},
  eprint       = {2210.03831},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-03831.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiH22,
  author       = {Jeremiah Blocki and
                  Blake Holman},
  title        = {Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent
                  Memory-Hard Functions},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {832},
  year         = {2022},
  url          = {https://eprint.iacr.org/2022/832},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiHL22,
  author       = {Jeremiah Blocki and
                  Blake Holman and
                  Seunghoon Lee},
  title        = {The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum
                  Security of iMHFs},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1503},
  year         = {2022},
  url          = {https://eprint.iacr.org/2022/1503},
  timestamp    = {Wed, 23 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiHL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/compsec/HarshaMBSD21,
  author       = {Benjamin Harsha and
                  Robert Morton and
                  Jeremiah Blocki and
                  John A. Springer and
                  Melissa Dark},
  title        = {Bicycle attacks considered harmful: Quantifying the damage of widespread
                  password length leakage},
  journal      = {Comput. Secur.},
  volume       = {100},
  pages        = {102068},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.cose.2020.102068},
  doi          = {10.1016/J.COSE.2020.102068},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/compsec/HarshaMBSD21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BlockiGGZ21,
  author       = {Jeremiah Blocki and
                  Venkata Gandikota and
                  Elena Grigorescu and
                  Samson Zhou},
  title        = {Relaxed Locally Correctable Codes in Computationally Bounded Channels},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {67},
  number       = {7},
  pages        = {4338--4360},
  year         = {2021},
  url          = {https://doi.org/10.1109/TIT.2021.3076396},
  doi          = {10.1109/TIT.2021.3076396},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tit/BlockiGGZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/citc/BlockiLZ21,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee and
                  Samson Zhou},
  editor       = {Stefano Tessaro},
  title        = {On the Security of Proofs of Sequential Work in a Post-Quantum World},
  booktitle    = {2nd Conference on Information-Theoretic Cryptography, {ITC} 2021,
                  July 23-26, 2021, Virtual Conference},
  series       = {LIPIcs},
  volume       = {199},
  pages        = {22:1--22:27},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ITC.2021.22},
  doi          = {10.4230/LIPICS.ITC.2021.22},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/citc/BlockiLZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fc/BaiB21,
  author       = {Wenjie Bai and
                  Jeremiah Blocki},
  editor       = {Nikita Borisov and
                  Claudia D{\'{\i}}az},
  title        = {DAHash: Distribution Aware Tuning of Password Hashing Costs},
  booktitle    = {Financial Cryptography and Data Security - 25th International Conference,
                  {FC} 2021, Virtual Event, March 1-5, 2021, Revised Selected Papers,
                  Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12675},
  pages        = {382--405},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-662-64331-0\_20},
  doi          = {10.1007/978-3-662-64331-0\_20},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fc/BaiB21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlockiCGLZZ21,
  author       = {Jeremiah Blocki and
                  Kuan Cheng and
                  Elena Grigorescu and
                  Xin Li and
                  Yu Zheng and
                  Minshen Zhu},
  title        = {Exponential Lower Bounds for Locally Decodable and Correctable Codes
                  for Insertions and Deletions},
  booktitle    = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2021, Denver, CO, USA, February 7-10, 2022},
  pages        = {739--750},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/FOCS52979.2021.00077},
  doi          = {10.1109/FOCS52979.2021.00077},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BlockiCGLZZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gamesec/BaiBH21,
  author       = {Wenjie Bai and
                  Jeremiah Blocki and
                  Benjamin Harsha},
  editor       = {Branislav Bosansk{\'{y}} and
                  Cleotilde Gonzalez and
                  Stefan Rass and
                  Arunesh Sinha},
  title        = {Password Strength Signaling: {A} Counter-Intuitive Defense Against
                  Password Cracking},
  booktitle    = {Decision and Game Theory for Security - 12th International Conference,
                  GameSec 2021, Virtual Event, October 25-27, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13061},
  pages        = {334--353},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-90370-1\_18},
  doi          = {10.1007/978-3-030-90370-1\_18},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/gamesec/BaiBH21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gpce/BaoSMYWJWALSDSK21,
  author       = {Yuyan Bao and
                  Kirshanthan Sundararajah and
                  Raghav Malik and
                  Qianchuan Ye and
                  Christopher Wagner and
                  Nouraldin Jaber and
                  Fei Wang and
                  Mohammad Hassan Ameri and
                  Donghang Lu and
                  Alexander Seto and
                  Benjamin Delaware and
                  Roopsha Samanta and
                  Aniket Kate and
                  Christina Garman and
                  Jeremiah Blocki and
                  Pierre{-}David Letourneau and
                  Beno{\^{\i}}t Meister and
                  Jonathan Springer and
                  Tiark Rompf and
                  Milind Kulkarni},
  editor       = {Eli Tilevich and
                  Coen De Roover},
  title        = {{HACCLE:} metaprogramming for secure multi-party computation},
  booktitle    = {{GPCE} '21: Concepts and Experiences, Chicago, IL, USA, October 17
                  - 18, 2021},
  pages        = {130--143},
  publisher    = {{ACM}},
  year         = {2021},
  url          = {https://doi.org/10.1145/3486609.3487205},
  doi          = {10.1145/3486609.3487205},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/gpce/BaoSMYWJWALSDSK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BlockiC21,
  author       = {Jeremiah Blocki and
                  Mike Cinkoske},
  editor       = {James R. Lee},
  title        = {A New Connection Between Node and Edge Depth Robust Graphs},
  booktitle    = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2021, January 6-8, 2021, Virtual Conference},
  series       = {LIPIcs},
  volume       = {185},
  pages        = {64:1--64:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2021.64},
  doi          = {10.4230/LIPICS.ITCS.2021.64},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/BlockiC21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/BlockiGM21,
  author       = {Jeremiah Blocki and
                  Elena Grigorescu and
                  Tamalika Mukherjee},
  title        = {Differentially-Private Sublinear-Time Clustering},
  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
                  Melbourne, Australia, July 12-20, 2021},
  pages        = {332--337},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/ISIT45174.2021.9518014},
  doi          = {10.1109/ISIT45174.2021.9518014},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isit/BlockiGM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/BlockB21,
  author       = {Alexander R. Block and
                  Jeremiah Blocki},
  title        = {Private and Resource-Bounded Locally Decodable Codes for Insertions
                  and Deletions},
  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
                  Melbourne, Australia, July 12-20, 2021},
  pages        = {1841--1846},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/ISIT45174.2021.9518249},
  doi          = {10.1109/ISIT45174.2021.9518249},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isit/BlockB21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-10374,
  author       = {Wenjie Bai and
                  Jeremiah Blocki},
  title        = {DAHash: Distribution Aware Tuning of Password Hashing Costs},
  journal      = {CoRR},
  volume       = {abs/2101.10374},
  year         = {2021},
  url          = {https://arxiv.org/abs/2101.10374},
  eprinttype    = {arXiv},
  eprint       = {2101.10374},
  timestamp    = {Sat, 30 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2101-10374.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-14122,
  author       = {Alexander R. Block and
                  Jeremiah Blocki},
  title        = {Private and Resource-Bounded Locally Decodable Codes for Insertions
                  and Deletions},
  journal      = {CoRR},
  volume       = {abs/2103.14122},
  year         = {2021},
  url          = {https://arxiv.org/abs/2103.14122},
  eprinttype    = {arXiv},
  eprint       = {2103.14122},
  timestamp    = {Wed, 07 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-14122.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-14170,
  author       = {Jeremiah Blocki and
                  Peiyuan Liu},
  title        = {Towards a Rigorous Statistical Analysis of Empirical Password Datasets},
  journal      = {CoRR},
  volume       = {abs/2105.14170},
  year         = {2021},
  url          = {https://arxiv.org/abs/2105.14170},
  eprinttype    = {arXiv},
  eprint       = {2105.14170},
  timestamp    = {Wed, 02 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2105-14170.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-04190,
  author       = {Jeremiah Blocki and
                  Mike Cinkoske and
                  Seunghoon Lee and
                  Jin Young Son},
  title        = {On Explicit Constructions of Extremely Depth Robust Graphs},
  journal      = {CoRR},
  volume       = {abs/2110.04190},
  year         = {2021},
  url          = {https://arxiv.org/abs/2110.04190},
  eprinttype    = {arXiv},
  eprint       = {2110.04190},
  timestamp    = {Thu, 21 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2110-04190.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-04191,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee},
  title        = {Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of
                  iMHFs},
  journal      = {CoRR},
  volume       = {abs/2110.04191},
  year         = {2021},
  url          = {https://arxiv.org/abs/2110.04191},
  eprinttype    = {arXiv},
  eprint       = {2110.04191},
  timestamp    = {Mon, 25 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2110-04191.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-01060,
  author       = {Jeremiah Blocki and
                  Kuan Cheng and
                  Elena Grigorescu and
                  Xin Li and
                  Yu Zheng and
                  Minshen Zhu},
  title        = {Exponential Lower Bounds for Locally Decodable and Correctable Codes
                  for Insertions and Deletions},
  journal      = {CoRR},
  volume       = {abs/2111.01060},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.01060},
  eprinttype    = {arXiv},
  eprint       = {2111.01060},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-01060.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-13751,
  author       = {Jeremiah Blocki and
                  Elena Grigorescu and
                  Tamalika Mukherjee},
  title        = {Differentially-Private Sublinear-Time Clustering},
  journal      = {CoRR},
  volume       = {abs/2112.13751},
  year         = {2021},
  url          = {https://arxiv.org/abs/2112.13751},
  eprinttype    = {arXiv},
  eprint       = {2112.13751},
  timestamp    = {Tue, 04 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-13751.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AmeriBB21,
  author       = {Mohammad Hassan Ameri and
                  Alexander R. Block and
                  Jeremiah Blocki},
  title        = {Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard
                  Functions and Resource-Bounded Locally Decodable Codes},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {801},
  year         = {2021},
  url          = {https://eprint.iacr.org/2021/801},
  timestamp    = {Wed, 07 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AmeriBB21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BlockBGKZ20,
  author       = {Alexander R. Block and
                  Jeremiah Blocki and
                  Elena Grigorescu and
                  Shubhang Kulkarni and
                  Minshen Zhu},
  editor       = {Nitin Saxena and
                  Sunil Simon},
  title        = {Locally Decodable/Correctable Codes for Insertions and Deletions},
  booktitle    = {40th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020,
                  {BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {182},
  pages        = {16:1--16:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.16},
  doi          = {10.4230/LIPICS.FSTTCS.2020.16},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/BlockBGKZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icits/BlockiKZ20,
  author       = {Jeremiah Blocki and
                  Shubhang Kulkarni and
                  Samson Zhou},
  editor       = {Yael Tauman Kalai and
                  Adam D. Smith and
                  Daniel Wichs},
  title        = {On Locally Decodable Codes in Resource Bounded Channels},
  booktitle    = {1st Conference on Information-Theoretic Cryptography, {ITC} 2020,
                  June 17-19, 2020, Boston, MA, {USA}},
  series       = {LIPIcs},
  volume       = {163},
  pages        = {16:1--16:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ITC.2020.16},
  doi          = {10.4230/LIPICS.ITC.2020.16},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icits/BlockiKZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BlockiLZ20,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee and
                  Samson Zhou},
  editor       = {Thomas Vidick},
  title        = {Approximating Cumulative Pebbling Cost Is Unique Games Hard},
  booktitle    = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2020, January 12-14, 2020, Seattle, Washington, {USA}},
  series       = {LIPIcs},
  volume       = {151},
  pages        = {13:1--13:27},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2020.13},
  doi          = {10.4230/LIPICS.ITCS.2020.13},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/BlockiLZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AmeriBZ20,
  author       = {Mohammad Hassan Ameri and
                  Jeremiah Blocki and
                  Samson Zhou},
  editor       = {Thomas Vidick},
  title        = {Computationally Data-Independent Memory Hard Functions},
  booktitle    = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2020, January 12-14, 2020, Seattle, Washington, {USA}},
  series       = {LIPIcs},
  volume       = {151},
  pages        = {36:1--36:28},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2020.36},
  doi          = {10.4230/LIPICS.ITCS.2020.36},
  timestamp    = {Wed, 15 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/AmeriBZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-01513,
  author       = {Benjamin Harsha and
                  Robert Morton and
                  Jeremiah Blocki and
                  John A. Springer and
                  Melissa Dark},
  title        = {Bicycle Attacks Considered Harmful: Quantifying the Damage of Widespread
                  Password Length Leakage},
  journal      = {CoRR},
  volume       = {abs/2002.01513},
  year         = {2020},
  url          = {https://arxiv.org/abs/2002.01513},
  eprinttype    = {arXiv},
  eprint       = {2002.01513},
  timestamp    = {Mon, 10 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-01513.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-05911,
  author       = {Benjamin Harsha and
                  Jeremiah Blocki},
  title        = {An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers},
  journal      = {CoRR},
  volume       = {abs/2005.05911},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.05911},
  eprinttype    = {arXiv},
  eprint       = {2005.05911},
  timestamp    = {Thu, 14 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-05911.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-09039,
  author       = {Jeremiah Blocki and
                  Wuwei Zhang},
  title        = {DALock: Distribution Aware Password Throttling},
  journal      = {CoRR},
  volume       = {abs/2005.09039},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.09039},
  eprinttype    = {arXiv},
  eprint       = {2005.09039},
  timestamp    = {Fri, 22 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-09039.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-05023,
  author       = {Jeremiah Blocki and
                  Benjamin Harsha and
                  Samson Zhou},
  title        = {On the Economics of Offline Password Cracking},
  journal      = {CoRR},
  volume       = {abs/2006.05023},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.05023},
  eprinttype    = {arXiv},
  eprint       = {2006.05023},
  timestamp    = {Fri, 12 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-05023.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-10972,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee and
                  Samson Zhou},
  title        = {On the Security of Proofs of Sequential Work in a Post-Quantum World},
  journal      = {CoRR},
  volume       = {abs/2006.10972},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.10972},
  eprinttype    = {arXiv},
  eprint       = {2006.10972},
  timestamp    = {Tue, 23 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-10972.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-01489,
  author       = {Yuyan Bao and
                  Kirshanthan Sundararajah and
                  Raghav Malik and
                  Qianchuan Ye and
                  Christopher Wagner and
                  Fei Wang and
                  Mohammad Hassan Ameri and
                  Donghang Lu and
                  Alexander Seto and
                  Benjamin Delaware and
                  Roopsha Samanta and
                  Aniket Kate and
                  Christina Garman and
                  Jeremiah Blocki and
                  Pierre{-}David Letourneau and
                  Beno{\^{\i}}t Meister and
                  Jonathan Springer and
                  Tiark Rompf and
                  Milind Kulkarni},
  title        = {{HACCLE:} An Ecosystem for Building Secure Multi-Party Computations},
  journal      = {CoRR},
  volume       = {abs/2009.01489},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.01489},
  eprinttype    = {arXiv},
  eprint       = {2009.01489},
  timestamp    = {Thu, 17 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-01489.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-10060,
  author       = {Wenjie Bai and
                  Jeremiah Blocki and
                  Benjamin Harsha},
  title        = {Information Signaling: {A} Counter-Intuitive Defense Against Password
                  Cracking},
  journal      = {CoRR},
  volume       = {abs/2009.10060},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.10060},
  eprinttype    = {arXiv},
  eprint       = {2009.10060},
  timestamp    = {Wed, 23 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-10060.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-11989,
  author       = {Alexander R. Block and
                  Jeremiah Blocki and
                  Elena Grigorescu and
                  Shubhang Kulkarni and
                  Minshen Zhu},
  title        = {Locally Decodable/Correctable Codes for Insertions and Deletions},
  journal      = {CoRR},
  volume       = {abs/2010.11989},
  year         = {2020},
  url          = {https://arxiv.org/abs/2010.11989},
  eprinttype    = {arXiv},
  eprint       = {2010.11989},
  timestamp    = {Tue, 27 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-11989.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BlockiHKLXZ19,
  author       = {Jeremiah Blocki and
                  Benjamin Harsha and
                  Siteng Kang and
                  Seunghoon Lee and
                  Lu Xing and
                  Samson Zhou},
  editor       = {Alexandra Boldyreva and
                  Daniele Micciancio},
  title        = {Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2019 - 39th Annual International
                  Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019,
                  Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {11693},
  pages        = {573--607},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-26951-7\_20},
  doi          = {10.1007/978-3-030-26951-7\_20},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/crypto/BlockiHKLXZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/BlockiGGZ19,
  author       = {Jeremiah Blocki and
                  Venkata Gandikota and
                  Elena Grigorescu and
                  Samson Zhou},
  title        = {Relaxed Locally Correctable Codes in Computationally Bounded Channels},
  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2019,
                  Paris, France, July 7-12, 2019},
  pages        = {2414--2418},
  publisher    = {{IEEE}},
  year         = {2019},
  url          = {https://doi.org/10.1109/ISIT.2019.8849322},
  doi          = {10.1109/ISIT.2019.8849322},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/isit/BlockiGGZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-08078,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee and
                  Samson Zhou},
  title        = {Approximating Cumulative Pebbling Cost is Unique Games Hard},
  journal      = {CoRR},
  volume       = {abs/1904.08078},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.08078},
  eprinttype    = {arXiv},
  eprint       = {1904.08078},
  timestamp    = {Fri, 26 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-08078.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-11245,
  author       = {Jeremiah Blocki and
                  Shubhang Kulkarni and
                  Samson Zhou},
  title        = {On Locally Decodable Codes in Resource Bounded Channels},
  journal      = {CoRR},
  volume       = {abs/1909.11245},
  year         = {2019},
  url          = {http://arxiv.org/abs/1909.11245},
  eprinttype    = {arXiv},
  eprint       = {1909.11245},
  timestamp    = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1909-11245.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-08920,
  author       = {Jeremiah Blocki and
                  Mike Cinkoske},
  title        = {A New Connection Between Node and Edge Depth Robust Graphs},
  journal      = {CoRR},
  volume       = {abs/1910.08920},
  year         = {2019},
  url          = {http://arxiv.org/abs/1910.08920},
  eprinttype    = {arXiv},
  eprint       = {1910.08920},
  timestamp    = {Tue, 22 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1910-08920.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-06790,
  author       = {Mohammad Hassan Ameri and
                  Jeremiah Blocki and
                  Samson Zhou},
  title        = {Computationally Data-Independent Memory Hard Functions},
  journal      = {CoRR},
  volume       = {abs/1911.06790},
  year         = {2019},
  url          = {http://arxiv.org/abs/1911.06790},
  eprinttype    = {arXiv},
  eprint       = {1911.06790},
  timestamp    = {Mon, 02 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1911-06790.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiL19,
  author       = {Jeremiah Blocki and
                  Seunghoon Lee},
  title        = {On the Multi-User Security of Short Schnorr Signatures},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {1105},
  year         = {2019},
  url          = {https://eprint.iacr.org/2019/1105},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/Blocki0Z18,
  author       = {Jeremiah Blocki and
                  Ling Ren and
                  Samson Zhou},
  editor       = {David Lie and
                  Mohammad Mannan and
                  Michael Backes and
                  XiaoFeng Wang},
  title        = {Bandwidth-Hard Functions: Reductions and Lower Bounds},
  booktitle    = {Proceedings of the 2018 {ACM} {SIGSAC} Conference on Computer and
                  Communications Security, {CCS} 2018, Toronto, ON, Canada, October
                  15-19, 2018},
  pages        = {1820--1836},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3243734.3243773},
  doi          = {10.1145/3243734.3243773},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ccs/Blocki0Z18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/AlwenBP18,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki and
                  Krzysztof Pietrzak},
  editor       = {Jesper Buus Nielsen and
                  Vincent Rijmen},
  title        = {Sustained Space Complexity},
  booktitle    = {Advances in Cryptology - {EUROCRYPT} 2018 - 37th Annual International
                  Conference on the Theory and Applications of Cryptographic Techniques,
                  Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10821},
  pages        = {99--130},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-78375-8\_4},
  doi          = {10.1007/978-3-319-78375-8\_4},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/eurocrypt/AlwenBP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurosp/HarshaB18,
  author       = {Benjamin Harsha and
                  Jeremiah Blocki},
  title        = {Just In Time Hashing},
  booktitle    = {2018 {IEEE} European Symposium on Security and Privacy, EuroS{\&}P
                  2018, London, United Kingdom, April 24-26, 2018},
  pages        = {368--383},
  publisher    = {{IEEE}},
  year         = {2018},
  url          = {https://doi.org/10.1109/EuroSP.2018.00033},
  doi          = {10.1109/EUROSP.2018.00033},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/eurosp/HarshaB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fc/BlockiZ18,
  author       = {Jeremiah Blocki and
                  Samson Zhou},
  editor       = {Sarah Meiklejohn and
                  Kazue Sako},
  title        = {On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling},
  booktitle    = {Financial Cryptography and Data Security - 22nd International Conference,
                  {FC} 2018, Nieuwpoort, Cura{\c{c}}ao, February 26 - March 2, 2018,
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {10957},
  pages        = {329--346},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-662-58387-6\_18},
  doi          = {10.1007/978-3-662-58387-6\_18},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fc/BlockiZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlockiGGZ18,
  author       = {Jeremiah Blocki and
                  Venkata Gandikota and
                  Elena Grigorescu and
                  Samson Zhou},
  editor       = {Ioannis Chatzigiannakis and
                  Christos Kaklamanis and
                  D{\'{a}}niel Marx and
                  Donald Sannella},
  title        = {Brief Announcement: Relaxed Locally Correctable Codes in Computationally
                  Bounded Channels},
  booktitle    = {45th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
  series       = {LIPIcs},
  volume       = {107},
  pages        = {106:1--106:4},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2018.106},
  doi          = {10.4230/LIPICS.ICALP.2018.106},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/BlockiGGZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sp/BlockiHZ18,
  author       = {Jeremiah Blocki and
                  Benjamin Harsha and
                  Samson Zhou},
  title        = {On the Economics of Offline Password Cracking},
  booktitle    = {2018 {IEEE} Symposium on Security and Privacy, {SP} 2018, Proceedings,
                  21-23 May 2018, San Francisco, California, {USA}},
  pages        = {853--871},
  publisher    = {{IEEE} Computer Society},
  year         = {2018},
  url          = {https://doi.org/10.1109/SP.2018.00009},
  doi          = {10.1109/SP.2018.00009},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sp/BlockiHZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-05652,
  author       = {Jeremiah Blocki and
                  Venkata Gandikota and
                  Elena Grigorescu and
                  Samson Zhou},
  title        = {Relaxed Locally Correctable Codes in Computationally Bounded Channels},
  journal      = {CoRR},
  volume       = {abs/1803.05652},
  year         = {2018},
  url          = {http://arxiv.org/abs/1803.05652},
  eprinttype    = {arXiv},
  eprint       = {1803.05652},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1803-05652.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HarshaB18,
  author       = {Benjamin Harsha and
                  Jeremiah Blocki},
  title        = {Just in Time Hashing},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {112},
  year         = {2018},
  url          = {http://eprint.iacr.org/2018/112},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/HarshaB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AlwenBP18,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki and
                  Krzysztof Pietrzak},
  title        = {Sustained Space Complexity},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {147},
  year         = {2018},
  url          = {http://eprint.iacr.org/2018/147},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AlwenBP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Blocki0Z18,
  author       = {Jeremiah Blocki and
                  Ling Ren and
                  Samson Zhou},
  title        = {Bandwidth-Hard Functions: Reductions and Lower Bounds},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {221},
  year         = {2018},
  url          = {http://eprint.iacr.org/2018/221},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/Blocki0Z18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiHKLXZ18,
  author       = {Jeremiah Blocki and
                  Benjamin Harsha and
                  Siteng Kang and
                  Seunghoon Lee and
                  Lu Xing and
                  Samson Zhou},
  title        = {Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {944},
  year         = {2018},
  url          = {https://eprint.iacr.org/2018/944},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiHKLXZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/AlwenBH17,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki and
                  Benjamin Harsha},
  editor       = {Bhavani Thuraisingham and
                  David Evans and
                  Tal Malkin and
                  Dongyan Xu},
  title        = {Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions},
  booktitle    = {Proceedings of the 2017 {ACM} {SIGSAC} Conference on Computer and
                  Communications Security, {CCS} 2017, Dallas, TX, USA, October 30 -
                  November 03, 2017},
  pages        = {1001--1017},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3133956.3134031},
  doi          = {10.1145/3133956.3134031},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ccs/AlwenBH17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/AlwenBP17,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki and
                  Krzysztof Pietrzak},
  editor       = {Jean{-}S{\'{e}}bastien Coron and
                  Jesper Buus Nielsen},
  title        = {Depth-Robust Graphs and Their Cumulative Memory Complexity},
  booktitle    = {Advances in Cryptology - {EUROCRYPT} 2017 - 36th Annual International
                  Conference on the Theory and Applications of Cryptographic Techniques,
                  Paris, France, April 30 - May 4, 2017, Proceedings, Part {III}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10212},
  pages        = {3--32},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-56617-7\_1},
  doi          = {10.1007/978-3-319-56617-7\_1},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/eurocrypt/AlwenBP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurosp/AlwenB17,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki},
  title        = {Towards Practical Attacks on Argon2i and Balloon Hashing},
  booktitle    = {2017 {IEEE} European Symposium on Security and Privacy, EuroS{\&}P
                  2017, Paris, France, April 26-28, 2017},
  pages        = {142--157},
  publisher    = {{IEEE}},
  year         = {2017},
  url          = {https://doi.org/10.1109/EuroSP.2017.47},
  doi          = {10.1109/EUROSP.2017.47},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/eurosp/AlwenB17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Blocki0DV17,
  author       = {Jeremiah Blocki and
                  Manuel Blum and
                  Anupam Datta and
                  Santosh S. Vempala},
  editor       = {Christos H. Papadimitriou},
  title        = {Towards Human Computable Passwords},
  booktitle    = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2017, January 9-11, 2017, Berkeley, CA, {USA}},
  series       = {LIPIcs},
  volume       = {67},
  pages        = {10:1--10:47},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2017.10},
  doi          = {10.4230/LIPICS.ITCS.2017.10},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/Blocki0DV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BlockiZ17,
  author       = {Jeremiah Blocki and
                  Samson Zhou},
  editor       = {Yael Kalai and
                  Leonid Reyzin},
  title        = {On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i},
  booktitle    = {Theory of Cryptography - 15th International Conference, {TCC} 2017,
                  Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10677},
  pages        = {445--465},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-70500-2\_15},
  doi          = {10.1007/978-3-319-70500-2\_15},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tcc/BlockiZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uss/WangBLJ17,
  author       = {Tianhao Wang and
                  Jeremiah Blocki and
                  Ninghui Li and
                  Somesh Jha},
  editor       = {Engin Kirda and
                  Thomas Ristenpart},
  title        = {Locally Differentially Private Protocols for Frequency Estimation},
  booktitle    = {26th {USENIX} Security Symposium, {USENIX} Security 2017, Vancouver,
                  BC, Canada, August 16-18, 2017},
  pages        = {729--745},
  publisher    = {{USENIX} Association},
  year         = {2017},
  url          = {https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/wang-tianhao},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/uss/WangBLJ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/WangBLJ17,
  author       = {Tianhao Wang and
                  Jeremiah Blocki and
                  Ninghui Li and
                  Somesh Jha},
  title        = {Optimizing Locally Differentially Private Protocols},
  journal      = {CoRR},
  volume       = {abs/1705.04421},
  year         = {2017},
  url          = {http://arxiv.org/abs/1705.04421},
  eprinttype    = {arXiv},
  eprint       = {1705.04421},
  timestamp    = {Sat, 08 Dec 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/WangBLJ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlwenBP17,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki and
                  Krzysztof Pietrzak},
  title        = {Sustained Space Complexity},
  journal      = {CoRR},
  volume       = {abs/1705.05313},
  year         = {2017},
  url          = {http://arxiv.org/abs/1705.05313},
  eprinttype    = {arXiv},
  eprint       = {1705.05313},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AlwenBP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiZ17,
  author       = {Jeremiah Blocki and
                  Samson Zhou},
  title        = {On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {442},
  year         = {2017},
  url          = {http://eprint.iacr.org/2017/442},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AlwenBH17,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki and
                  Benjamin Harsha},
  title        = {Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {443},
  year         = {2017},
  url          = {http://eprint.iacr.org/2017/443},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AlwenBH17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/BlockiS16,
  author       = {Jeremiah Blocki and
                  Anirudh Sridhar},
  editor       = {Xiaofeng Chen and
                  XiaoFeng Wang and
                  Xinyi Huang},
  title        = {Client-CASH: Protecting Master Passwords against Offline Attacks},
  booktitle    = {Proceedings of the 11th {ACM} on Asia Conference on Computer and Communications
                  Security, AsiaCCS 2016, Xi'an, China, May 30 - June 3, 2016},
  pages        = {165--176},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2897845.2897876},
  doi          = {10.1145/2897845.2897876},
  timestamp    = {Mon, 25 Apr 2022 08:42:03 +0200},
  biburl       = {https://dblp.org/rec/conf/ccs/BlockiS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/AlwenB16,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki},
  editor       = {Matthew Robshaw and
                  Jonathan Katz},
  title        = {Efficiently Computing Data-Independent Memory-Hard Functions},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2016 - 36th Annual International
                  Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016,
                  Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9815},
  pages        = {241--271},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-53008-5\_9},
  doi          = {10.1007/978-3-662-53008-5\_9},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/AlwenB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csfw/BlockiD16,
  author       = {Jeremiah Blocki and
                  Anupam Datta},
  title        = {{CASH:} {A} Cost Asymmetric Secure Hash Algorithm for Optimal Password
                  Protection},
  booktitle    = {{IEEE} 29th Computer Security Foundations Symposium, {CSF} 2016, Lisbon,
                  Portugal, June 27 - July 1, 2016},
  pages        = {371--386},
  publisher    = {{IEEE} Computer Society},
  year         = {2016},
  url          = {https://doi.org/10.1109/CSF.2016.33},
  doi          = {10.1109/CSF.2016.33},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/csfw/BlockiD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ndss/BlockiDB16,
  author       = {Jeremiah Blocki and
                  Anupam Datta and
                  Joseph Bonneau},
  title        = {Differentially Private Password Frequency Lists},
  booktitle    = {23rd Annual Network and Distributed System Security Symposium, {NDSS}
                  2016, San Diego, California, USA, February 21-24, 2016},
  publisher    = {The Internet Society},
  year         = {2016},
  url          = {http://wp.internetsociety.org/ndss/wp-content/uploads/sites/25/2017/09/differentially-private-password-frequency-lists.pdf},
  timestamp    = {Thu, 17 Jun 2021 16:04:48 +0200},
  biburl       = {https://dblp.org/rec/conf/ndss/BlockiDB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/BlockiZ16,
  author       = {Jeremiah Blocki and
                  Hong{-}Sheng Zhou},
  editor       = {Martin Hirt and
                  Adam D. Smith},
  title        = {Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond},
  booktitle    = {Theory of Cryptography - 14th International Conference, {TCC} 2016-B,
                  Beijing, China, October 31 - November 3, 2016, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9986},
  pages        = {517--546},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-53644-5\_20},
  doi          = {10.1007/978-3-662-53644-5\_20},
  timestamp    = {Tue, 20 Aug 2024 08:48:08 +0200},
  biburl       = {https://dblp.org/rec/conf/tcc/BlockiZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlockiS16,
  author       = {Jeremiah Blocki and
                  Anirudh Sridhar},
  title        = {Client-CASH: Protecting Master Passwords against Offline Attacks},
  journal      = {CoRR},
  volume       = {abs/1603.00913},
  year         = {2016},
  url          = {http://arxiv.org/abs/1603.00913},
  eprinttype    = {arXiv},
  eprint       = {1603.00913},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BlockiS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlockiZ16,
  author       = {Jeremiah Blocki and
                  Samson Zhou},
  title        = {On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling},
  journal      = {CoRR},
  volume       = {abs/1609.04449},
  year         = {2016},
  url          = {http://arxiv.org/abs/1609.04449},
  eprinttype    = {arXiv},
  eprint       = {1609.04449},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BlockiZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AlwenB16,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki},
  title        = {Efficiently Computing Data-Independent Memory-Hard Functions},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {115},
  year         = {2016},
  url          = {http://eprint.iacr.org/2016/115},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AlwenB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiZ16,
  author       = {Jeremiah Blocki and
                  Hong{-}Sheng Zhou},
  title        = {Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {145},
  year         = {2016},
  url          = {http://eprint.iacr.org/2016/145},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiDB16,
  author       = {Jeremiah Blocki and
                  Anupam Datta and
                  Joseph Bonneau},
  title        = {Differentially Private Password Frequency Lists},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {153},
  year         = {2016},
  url          = {http://eprint.iacr.org/2016/153},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiDB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AlwenB16a,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki},
  title        = {Towards Practical Attacks on Argon2i and Balloon Hashing},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {759},
  year         = {2016},
  url          = {http://eprint.iacr.org/2016/759},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AlwenB16a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AlwenBP16,
  author       = {Jo{\"{e}}l Alwen and
                  Jeremiah Blocki and
                  Krzysztof Pietrzak},
  title        = {Depth-Robust Graphs and Their Cumulative Memory Complexity},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {875},
  year         = {2016},
  url          = {http://eprint.iacr.org/2016/875},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/AlwenBP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BlockiCDPS15,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Ariel D. Procaccia and
                  Arunesh Sinha},
  editor       = {Blai Bonet and
                  Sven Koenig},
  title        = {Audit Games with Multiple Defender Resources},
  booktitle    = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,
                  January 25-30, 2015, Austin, Texas, {USA}},
  pages        = {791--797},
  publisher    = {{AAAI} Press},
  year         = {2015},
  url          = {https://doi.org/10.1609/aaai.v29i1.9317},
  doi          = {10.1609/AAAI.V29I1.9317},
  timestamp    = {Mon, 18 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/BlockiCDPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ndss/BlockiKCD15,
  author       = {Jeremiah Blocki and
                  Saranga Komanduri and
                  Lorrie Faith Cranor and
                  Anupam Datta},
  title        = {Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords},
  booktitle    = {22nd Annual Network and Distributed System Security Symposium, {NDSS}
                  2015, San Diego, California, USA, February 8-11, 2015},
  publisher    = {The Internet Society},
  year         = {2015},
  url          = {https://www.ndss-symposium.org/ndss2015/spaced-repetition-and-mnemonics-enable-recall-multiple-strong-passwords},
  timestamp    = {Mon, 01 Feb 2021 08:42:14 +0100},
  biburl       = {https://dblp.org/rec/conf/ndss/BlockiKCD15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlockiD15,
  author       = {Jeremiah Blocki and
                  Anupam Datta},
  title        = {{CASH:} {A} Cost Asymmetric Secure Hash Algorithm for Optimal Password
                  Protection},
  journal      = {CoRR},
  volume       = {abs/1509.00239},
  year         = {2015},
  url          = {http://arxiv.org/abs/1509.00239},
  eprinttype    = {arXiv},
  eprint       = {1509.00239},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BlockiD15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlockiBD15,
  author       = {Jeremiah Blocki and
                  Manuel Blum and
                  Anupam Datta},
  title        = {Naturally Rehearsing Passwords},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {166},
  year         = {2015},
  url          = {http://eprint.iacr.org/2015/166},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlockiBD15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlockiBD14,
  author       = {Jeremiah Blocki and
                  Manuel Blum and
                  Anupam Datta},
  title        = {Human Computable Passwords},
  journal      = {CoRR},
  volume       = {abs/1404.0024},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.0024},
  eprinttype    = {arXiv},
  eprint       = {1404.0024},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BlockiBD14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeidemanB14,
  author       = {Calvin Beideman and
                  Jeremiah Blocki},
  title        = {Set Families with Low Pairwise Intersection},
  journal      = {CoRR},
  volume       = {abs/1404.4622},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.4622},
  eprinttype    = {arXiv},
  eprint       = {1404.4622},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BeidemanB14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlockiCDPS14,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Ariel D. Procaccia and
                  Arunesh Sinha},
  title        = {Audit Games with Multiple Defender Resources},
  journal      = {CoRR},
  volume       = {abs/1409.4503},
  year         = {2014},
  url          = {http://arxiv.org/abs/1409.4503},
  eprinttype    = {arXiv},
  eprint       = {1409.4503},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BlockiCDPS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlockiKCD14,
  author       = {Jeremiah Blocki and
                  Saranga Komanduri and
                  Lorrie Faith Cranor and
                  Anupam Datta},
  title        = {Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords},
  journal      = {CoRR},
  volume       = {abs/1410.1490},
  year         = {2014},
  url          = {http://arxiv.org/abs/1410.1490},
  eprinttype    = {arXiv},
  eprint       = {1410.1490},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BlockiKCD14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/BlockiBD13,
  author       = {Jeremiah Blocki and
                  Manuel Blum and
                  Anupam Datta},
  editor       = {Kazue Sako and
                  Palash Sarkar},
  title        = {Naturally Rehearsing Passwords},
  booktitle    = {Advances in Cryptology - {ASIACRYPT} 2013 - 19th International Conference
                  on the Theory and Application of Cryptology and Information Security,
                  Bengaluru, India, December 1-5, 2013, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8270},
  pages        = {361--380},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-42045-0\_19},
  doi          = {10.1007/978-3-642-42045-0\_19},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/asiacrypt/BlockiBD13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/BlockiBD13,
  author       = {Jeremiah Blocki and
                  Manuel Blum and
                  Anupam Datta},
  editor       = {Ahmad{-}Reza Sadeghi and
                  Blaine Nelson and
                  Christos Dimitrakakis and
                  Elaine Shi},
  title        = {{GOTCHA} password hackers!},
  booktitle    = {AISec'13, Proceedings of the 2013 {ACM} Workshop on Artificial Intelligence
                  and Security, Co-located with {CCS} 2013, Berlin, Germany, November
                  4, 2013},
  pages        = {25--34},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2517312.2517319},
  doi          = {10.1145/2517312.2517319},
  timestamp    = {Tue, 10 Nov 2020 16:06:16 +0100},
  biburl       = {https://dblp.org/rec/conf/ccs/BlockiBD13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gamesec/BlockiCDS13,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Arunesh Sinha},
  editor       = {Sajal K. Das and
                  Cristina Nita{-}Rotaru and
                  Murat Kantarcioglu},
  title        = {Adaptive Regret Minimization in Bounded-Memory Games},
  booktitle    = {Decision and Game Theory for Security - 4th International Conference,
                  GameSec 2013, Fort Worth, TX, USA, November 11-12, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8252},
  pages        = {65--84},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-319-02786-9\_5},
  doi          = {10.1007/978-3-319-02786-9\_5},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/gamesec/BlockiCDS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BlockiCDPS13,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Ariel D. Procaccia and
                  Arunesh Sinha},
  editor       = {Francesca Rossi},
  title        = {Audit Games},
  booktitle    = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference
                  on Artificial Intelligence, Beijing, China, August 3-9, 2013},
  pages        = {41--47},
  publisher    = {{IJCAI/AAAI}},
  year         = {2013},
  url          = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6951},
  timestamp    = {Tue, 23 Jan 2024 13:25:46 +0100},
  biburl       = {https://dblp.org/rec/conf/ijcai/BlockiCDPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BlockiBDS13,
  author       = {Jeremiah Blocki and
                  Avrim Blum and
                  Anupam Datta and
                  Or Sheffet},
  editor       = {Robert D. Kleinberg},
  title        = {Differentially private data analysis of social networks via restricted
                  sensitivity},
  booktitle    = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
                  CA, USA, January 9-12, 2013},
  pages        = {87--96},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2422436.2422449},
  doi          = {10.1145/2422436.2422449},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/BlockiBDS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/BlockiKPS13,
  author       = {Jeremiah Blocki and
                  Saranga Komanduri and
                  Ariel D. Procaccia and
                  Or Sheffet},
  editor       = {Michael J. Kearns and
                  R. Preston McAfee and
                  {\'{E}}va Tardos},
  title        = {Optimizing password composition policies},
  booktitle    = {Proceedings of the fourteenth {ACM} Conference on Electronic Commerce,
                  {EC} 2013, Philadelphia, PA, USA, June 16-20, 2013},
  pages        = {105--122},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2492002.2482552},
  doi          = {10.1145/2492002.2482552},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sigecom/BlockiKPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-5101,
  author       = {Jeremiah Blocki and
                  Saranga Komanduri and
                  Ariel D. Procaccia and
                  Or Sheffet},
  title        = {Optimizing Password Composition Policies},
  journal      = {CoRR},
  volume       = {abs/1302.5101},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.5101},
  eprinttype    = {arXiv},
  eprint       = {1302.5101},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-5101.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-5122,
  author       = {Jeremiah Blocki and
                  Manuel Blum and
                  Anupam Datta},
  title        = {Naturally Rehearsing Passwords},
  journal      = {CoRR},
  volume       = {abs/1302.5122},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.5122},
  eprinttype    = {arXiv},
  eprint       = {1302.5122},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-5122.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-0356,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Ariel D. Procaccia and
                  Arunesh Sinha},
  title        = {Audit Games},
  journal      = {CoRR},
  volume       = {abs/1303.0356},
  year         = {2013},
  url          = {http://arxiv.org/abs/1303.0356},
  eprinttype    = {arXiv},
  eprint       = {1303.0356},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1303-0356.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlockiBD13,
  author       = {Jeremiah Blocki and
                  Manuel Blum and
                  Anupam Datta},
  title        = {{GOTCHA} Password Hackers!},
  journal      = {CoRR},
  volume       = {abs/1310.1137},
  year         = {2013},
  url          = {http://arxiv.org/abs/1310.1137},
  eprinttype    = {arXiv},
  eprint       = {1310.1137},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BlockiBD13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlockiBDS12,
  author       = {Jeremiah Blocki and
                  Avrim Blum and
                  Anupam Datta and
                  Or Sheffet},
  title        = {The Johnson-Lindenstrauss Transform Itself Preserves Differential
                  Privacy},
  booktitle    = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages        = {410--419},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/FOCS.2012.67},
  doi          = {10.1109/FOCS.2012.67},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BlockiBDS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gamesec/BlockiCDS12,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Arunesh Sinha},
  editor       = {Jens Grossklags and
                  Jean C. Walrand},
  title        = {Audit Mechanisms for Provable Risk Management and Accountable Data
                  Governance},
  booktitle    = {Decision and Game Theory for Security - Third International Conference,
                  GameSec 2012, Budapest, Hungary, November 5-6, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7638},
  pages        = {38--59},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-34266-0\_3},
  doi          = {10.1007/978-3-642-34266-0\_3},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/gamesec/BlockiCDS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-2136,
  author       = {Jeremiah Blocki and
                  Avrim Blum and
                  Anupam Datta and
                  Or Sheffet},
  title        = {The Johnson-Lindenstrauss Transform Itself Preserves Differential
                  Privacy},
  journal      = {CoRR},
  volume       = {abs/1204.2136},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.2136},
  eprinttype    = {arXiv},
  eprint       = {1204.2136},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-2136.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-4586,
  author       = {Jeremiah Blocki and
                  Avrim Blum and
                  Anupam Datta and
                  Or Sheffet},
  title        = {Differentially Private Data Analysis of Social Networks via Restricted
                  Sensitivity},
  journal      = {CoRR},
  volume       = {abs/1208.4586},
  year         = {2012},
  url          = {http://arxiv.org/abs/1208.4586},
  eprinttype    = {arXiv},
  eprint       = {1208.4586},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1208-4586.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csfw/BlockiCDS11,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Arunesh Sinha},
  title        = {Regret Minimizing Audits: {A} Learning-Theoretic Basis for Privacy
                  Protection},
  booktitle    = {Proceedings of the 24th {IEEE} Computer Security Foundations Symposium,
                  {CSF} 2011, Cernay-la-Ville, France, 27-29 June, 2011},
  pages        = {312--327},
  publisher    = {{IEEE} Computer Society},
  year         = {2011},
  url          = {https://doi.org/10.1109/CSF.2011.28},
  doi          = {10.1109/CSF.2011.28},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/csfw/BlockiCDS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iciss/DattaBCDGJKS11,
  author       = {Anupam Datta and
                  Jeremiah Blocki and
                  Nicolas Christin and
                  Henry DeYoung and
                  Deepak Garg and
                  Limin Jia and
                  Dilsun Kirli Kaynar and
                  Arunesh Sinha},
  editor       = {Sushil Jajodia and
                  Chandan Mazumdar},
  title        = {Understanding and Protecting Privacy: Formal Semantics and Principled
                  Audit Mechanisms},
  booktitle    = {Information Systems Security - 7th International Conference, {ICISS}
                  2011, Kolkata, India, December 15-19, 2011, Procedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7093},
  pages        = {1--27},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25560-1\_1},
  doi          = {10.1007/978-3-642-25560-1\_1},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iciss/DattaBCDGJKS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uss/BlockiCDS11,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Arunesh Sinha},
  editor       = {Ben Adida and
                  Umesh Shankar},
  title        = {Audit Mechanisms for Privacy Protection in Healthcare Environments},
  booktitle    = {2nd {USENIX} Workshop on Health Security and Privacy, HealthSec'11,
                  San Francisco, CA, USA, August 9, 2011},
  publisher    = {{USENIX} Association},
  year         = {2011},
  url          = {https://www.usenix.org/conference/healthsec11/audit-mechanisms-privacy-protection-healthcare-environments},
  timestamp    = {Mon, 01 Feb 2021 17:03:06 +0100},
  biburl       = {https://dblp.org/rec/conf/uss/BlockiCDS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uss/HannaRMPBFS11,
  author       = {Steve Hanna and
                  Rolf Rolles and
                  Andres Molina{-}Markham and
                  Pongsin Poosankam and
                  Jeremiah Blocki and
                  Kevin Fu and
                  Dawn Song},
  editor       = {Ben Adida and
                  Umesh Shankar},
  title        = {Take Two Software Updates and See Me in the Morning: The Case for
                  Software Security Evaluations of Medical Devices},
  booktitle    = {2nd {USENIX} Workshop on Health Security and Privacy, HealthSec'11,
                  San Francisco, CA, USA, August 9, 2011},
  publisher    = {{USENIX} Association},
  year         = {2011},
  url          = {https://www.usenix.org/conference/healthsec11/take-two-software-updates-and-see-me-morning-case-software-security},
  timestamp    = {Mon, 01 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/uss/HannaRMPBFS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-2888,
  author       = {Jeremiah Blocki and
                  Nicolas Christin and
                  Anupam Datta and
                  Arunesh Sinha},
  title        = {Adaptive Regret Minimization in Bounded-Memory Games},
  journal      = {CoRR},
  volume       = {abs/1111.2888},
  year         = {2011},
  url          = {http://arxiv.org/abs/1111.2888},
  eprinttype    = {arXiv},
  eprint       = {1111.2888},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1111-2888.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlockiW10,
  author       = {Jeremiah Blocki and
                  Ryan Williams},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {Resolving the Complexity of Some Data Privacy Problems},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6199},
  pages        = {393--404},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14162-1\_33},
  doi          = {10.1007/978-3-642-14162-1\_33},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BlockiW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-3811,
  author       = {Jeremiah Blocki and
                  Ryan Williams},
  title        = {Resolving the Complexity of Some Data Privacy Problems},
  journal      = {CoRR},
  volume       = {abs/1004.3811},
  year         = {2010},
  url          = {http://arxiv.org/abs/1004.3811},
  eprinttype    = {arXiv},
  eprint       = {1004.3811},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1004-3811.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}