( en | de | ru )

 

Disambiguation of "Holmgren, Justin"

Author of the publication

copydeleteadd this publication to your clipboard
PPAD is as Hard as LWE and Iterated Squaring.

, , , , , , and . IACR Cryptol. ePrint Arch., (2022)

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.

Rolf Holmgren

Rolf Holmgren

Rolf Holmgren

Justin Lang

Justin Winter

 

Other publications of authors with the same name

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads., , , , and . IACR Cryptol. ePrint Arch., (2020)On the Plausibility of Fully Homomorphic Encryption for RAMs., , , and . IACR Cryptol. ePrint Arch., (2019)On Round-By-Round Soundness and State Restoration Attacks.. IACR Cryptol. ePrint Arch., (2019)The parallel repetition of non-signaling games: counterexamples and dichotomy., and . STOC, page 185-192. ACM, (2019)Counterexamples to the Low-Degree Conjecture., and . ITCS, volume 185 of LIPIcs, page 75:1-75:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Linear-Size Boolean Circuits for Multiselection., and . CCC, volume 300 of LIPIcs, page 11:1-11:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Parallel Repetition Theorem for the GHZ Game., and . Electron. Colloquium Comput. Complex., (2020)Delegation for Search Problems., , and . ICALP, volume 229 of LIPIcs, page 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Watermarking Cryptographic Capabilities., , , , and . SIAM J. Comput., 47 (6): 2157-2202 (2018)Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications)., and . FOCS, page 850-858. IEEE Computer Society, (2018)