( en | de | ru )

 

Disambiguation of "Blocki, Jeremiah"

Author of the publication

copydeleteadd this publication to your clipboard
On the Security of Proofs of Sequential Work in a Post-Quantum World.

, , and . ITC, volume 199 of LIPIcs, page 22:1-22:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jeremiah Smith

Jeremiah Ikegbusi

Jeremiah Uhuo

Jeremiah Alberg

Jeremiah Chukudike Ijemba

 

Other publications of authors with the same name

Differentially private data analysis of social networks via restricted sensitivity., , , and . ITCS, page 87-96. ACM, (2013)Locally Differentially Private Protocols for Frequency Estimation., , , and . USENIX Security Symposium, page 729-745. USENIX Association, (2017)Cost-Asymmetric Memory Hard Password Hashing., , and . SCN, volume 13409 of Lecture Notes in Computer Science, page 21-44. Springer, (2022)Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions., , and . CCS, page 1001-1017. ACM, (2017)The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs., , and . TCC (1), volume 13747 of Lecture Notes in Computer Science, page 52-79. Springer, (2022)Understanding and Protecting Privacy: Formal Semantics and Principled Audit Mechanisms., , , , , , , and . ICISS, volume 7093 of Lecture Notes in Computer Science, page 1-27. Springer, (2011)Audit Mechanisms for Provable Risk Management and Accountable Data Governance., , , and . GameSec, volume 7638 of Lecture Notes in Computer Science, page 38-59. Springer, (2012)Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model., , , and . ICLR, OpenReview.net, (2023)On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling., and . Financial Cryptography, volume 10957 of Lecture Notes in Computer Science, page 329-346. Springer, (2018)Computationally Data-Independent Memory Hard Functions., , and . ITCS, volume 151 of LIPIcs, page 36:1-36:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)