default search action
Justin Holmgren
Person information
- affiliation (PhD 2018): Massachusetts Institute of Technology, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c30]Justin Holmgren, Ron Rothblum:
Linear-Size Boolean Circuits for Multiselection. CCC 2024: 11:1-11:20 - [i42]Justin Holmgren, Brent Waters:
Separating Selective Opening Security From Standard Security, Assuming IO. IACR Cryptol. ePrint Arch. 2024: 1080 (2024) - 2023
- [c29]Justin Holmgren
, Ruta Jawale:
Locally Covert Learning. ITC 2023: 14:1-14:12 - [i41]Justin Holmgren
Linear-Size Boolean Circuits for Multiselection. Electron. Colloquium Comput. Complex. TR23 (2023) - [i40]Justin Holmgren
Locally Covert Learning. IACR Cryptol. ePrint Arch. 2023: 392 (2023) - 2022
- [c28]Justin Holmgren, Minghao Liu, LaKyah Tyner, Daniel Wichs:
Nearly Optimal Property Preserving Hashing. CRYPTO (3) 2022: 473-502 - [c27]Justin Holmgren, Ron D. Rothblum:
Faster Sounder Succinct Arguments and sfIOPs. CRYPTO (1) 2022: 474-503 - [c26]Justin Holmgren
Delegation for Search Problems. ICALP 2022: 73:1-73:18 - [c25]Uma Girish, Justin Holmgren
Parallel repetition for all 3-player games over binary alphabet. STOC 2022: 998-1009 - [c24]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) 2022: 593-622 - [i39]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR abs/2202.06826 (2022) - [i38]Uma Girish, Justin Holmgren
Parallel Repetition For All 3-Player Games Over Binary Alphabet. Electron. Colloquium Comput. Complex. TR22 (2022) - [i37]Justin Holmgren
Nearly Optimal Property Preserving Hashing. IACR Cryptol. ePrint Arch. 2022: 842 (2022) - [i36]Justin Holmgren
Faster Sounder Succinct Arguments and IOPs. IACR Cryptol. ePrint Arch. 2022: 994 (2022) - [i35]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren
PPAD is as Hard as LWE and Iterated Squaring. IACR Cryptol. ePrint Arch. 2022: 1272 (2022) - 2021
- [c23]Uma Girish, Justin Holmgren
Parallel Repetition for the GHZ Game: A Simpler Proof. APPROX-RANDOM 2021: 62:1-62:19 - [c22]Alexander R. Block
Time- and Space-Efficient Arguments from Groups of Unknown Order. CRYPTO (4) 2021: 123-152 - [c21]Ofer Grossman, Justin Holmgren
Error Correcting Codes for Uncompressed Messages. ITCS 2021: 43:1-43:18 - [c20]Justin Holmgren
Counterexamples to the Low-Degree Conjecture. ITCS 2021: 75:1-75:9 - [c19]Justin Holmgren
Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge). STOC 2021: 750-760 - [i34]Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition for the GHZ Game: A Simpler Proof. CoRR abs/2107.06156 (2021) - [i33]Uma Girish, Justin Holmgren
A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. Electron. Colloquium Comput. Complex. TR21 (2021) - [i32]Justin Holmgren
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). Electron. Colloquium Comput. Complex. TR21 (2021) - [i31]Justin Holmgren
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). IACR Cryptol. ePrint Arch. 2021: 286 (2021) - [i30]Alexander R. Block, Justin Holmgren
Time- and Space-Efficient Arguments from Groups of Unknown Order. IACR Cryptol. ePrint Arch. 2021: 358 (2021) - [i29]Elette Boyle, Justin Holmgren
On the Security of Doubly Efficient PIR. IACR Cryptol. ePrint Arch. 2021: 1113 (2021) - 2020
- [c18]Marshall Ball
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? ITCS 2020: 86:1-86:22 - [c17]Alexander R. Block
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. TCC (2) 2020: 168-197 - [c16]Ofer Grossman, Justin Holmgren, Eylon Yogev:
Transparent Error Correcting in a Computationally Bounded World. TCC (3) 2020: 530-549 - [i28]Justin Holmgren, Alexander S. Wein:
Counterexamples to the Low-Degree Conjecture. CoRR abs/2004.08454 (2020) - [i27]Justin Holmgren, Ran Raz:
A Parallel Repetition Theorem for the GHZ Game. CoRR abs/2008.05059 (2020) - [i26]Ofer Grossman, Justin Holmgren
Error Correcting Codes for Uncompressed Messages. Electron. Colloquium Comput. Complex. TR20 (2020) - [i25]Justin Holmgren
No-Signaling MIPs and Faster-Than-Light Communication, Revisited. Electron. Colloquium Comput. Complex. TR20 (2020) - [i24]Justin Holmgren
A Parallel Repetition Theorem for the GHZ Game. Electron. Colloquium Comput. Complex. TR20 (2020) - [i23]Ofer Grossman, Justin Holmgren
Transparent Error Correcting in a Computationally Bounded World. IACR Cryptol. ePrint Arch. 2020: 1411 (2020) - [i22]Alexander R. Block, Justin Holmgren
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. IACR Cryptol. ePrint Arch. 2020: 1425 (2020)
2010 – 2019
- 2019
- [c15]Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs:
On the Plausibility of Fully Homomorphic Encryption for RAMs. CRYPTO (1) 2019: 589-619 - [c14]Justin Holmgren
The parallel repetition of non-signaling games: counterexamples and dichotomy. STOC 2019: 185-192 - [c13]Ran Canetti, Yilei Chen, Justin Holmgren
Fiat-Shamir: from practice to theory. STOC 2019: 1082-1090 - [c12]Elette Boyle, Justin Holmgren, Mor Weiss:
Permuted Puzzles and Cryptographic Hardness. TCC (2) 2019: 465-493 - [c11]James Bartusek
On the (In)security of Kilian-Based SNARGs. TCC (2) 2019: 522-551 - [i21]Ariel Hamlin, Justin Holmgren
On the Plausibility of Fully Homomorphic Encryption for RAMs. IACR Cryptol. ePrint Arch. 2019: 632 (2019) - [i20]James Bartusek, Liron Bronfman, Justin Holmgren
On the (In)security of Kilian-Based SNARGs. IACR Cryptol. ePrint Arch. 2019: 997 (2019) - [i19]Elette Boyle, Justin Holmgren
Permuted Puzzles and Cryptographic Hardness. IACR Cryptol. ePrint Arch. 2019: 1256 (2019) - [i18]Justin Holmgren
On Round-By-Round Soundness and State Restoration Attacks. IACR Cryptol. ePrint Arch. 2019: 1261 (2019) - 2018
- [b1]Justin Lee Holmgren
Secure computation on untrusted platforms. Massachusetts Institute of Technology, Cambridge, USA, 2018 - [j2]Nir Bitansky, Ran Canetti, Sanjam Garg
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. SIAM J. Comput. 47(3): 1123-1210 (2018) - [j1]Aloni Cohen, Justin Holmgren
Watermarking Cryptographic Capabilities. SIAM J. Comput. 47(6): 2157-2202 (2018) - [c10]Justin Holmgren
Delegating Computations with (Almost) Minimal Time and Space Overhead. FOCS 2018: 124-135 - [c9]Justin Holmgren
Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). FOCS 2018: 850-858 - [i17]Justin Holmgren
Delegating Computations with (almost) Minimal Time and Space Overhead. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Justin Holmgren
Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples and a Dichotomy Theorem. Electron. Colloquium Comput. Complex. TR18 (2018) - [i15]Justin Holmgren
Cryptographic Hashing From Strong One-Way Functions. IACR Cryptol. ePrint Arch. 2018: 385 (2018) - [i14]Justin Holmgren
Delegating Computations with (almost) Minimal Time and Space Overhead. IACR Cryptol. ePrint Arch. 2018: 861 (2018) - [i13]Ran Canetti, Yilei Chen, Justin Holmgren
Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch. 2018: 1004 (2018) - 2017
- [c8]Zvika Brakerski, Justin Holmgren
Non-interactive delegation and batch NP verification from standard computational assumptions. STOC 2017: 474-482 - [c7]Ran Canetti, Justin Holmgren, Silas Richelson:
Towards Doubly Efficient Private Information Retrieval. TCC (2) 2017: 694-726 - [i12]Justin Holmgren
(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games. Electron. Colloquium Comput. Complex. TR17 (2017) - [i11]Ran Canetti, Justin Holmgren
Towards Doubly Efficient Private Information Retrieval. IACR Cryptol. ePrint Arch. 2017: 568 (2017) - [i10]Justin Holmgren
(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games. IACR Cryptol. ePrint Arch. 2017: 1138 (2017) - 2016
- [c6]Ran Canetti, Justin Holmgren
Fully Succinct Garbled RAM. ITCS 2016: 169-178 - [c5]Aloni Cohen, Justin Holmgren
Watermarking cryptographic capabilities. STOC 2016: 1115-1127 - [c4]Ran Canetti, Yilei Chen, Justin Holmgren, Mariana Raykova:
Adaptive Succinct Garbled RAM or: How to Delegate Your Database. TCC (B2) 2016: 61-90 - [i9]Zvika Brakerski, Justin Holmgren
Non-Interactive RAM and Batch NP Delegation from any PIR. Electron. Colloquium Comput. Complex. TR16 (2016) - [i8]Zvika Brakerski, Justin Holmgren
Non-Interactive RAM and Batch NP Delegation from any PIR. IACR Cryptol. ePrint Arch. 2016: 459 (2016) - 2015
- [c3]Aloni Cohen, Justin Holmgren:
Multilinear Pseudorandom Functions. ICALP (1) 2015: 331-342 - [c2]Ran Canetti, Justin Holmgren
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs. STOC 2015: 429-437 - [i7]Aloni Cohen, Justin Holmgren
Multilinear Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2015: 125 (2015) - [i6]Aloni Cohen, Justin Holmgren
Publicly Verifiable Software Watermarking. IACR Cryptol. ePrint Arch. 2015: 373 (2015) - [i5]Ran Canetti, Justin Holmgren
Fully Succinct Garbled RAM. IACR Cryptol. ePrint Arch. 2015: 388 (2015) - [i4]Justin Holmgren
On Necessary Padding with IO. IACR Cryptol. ePrint Arch. 2015: 627 (2015) - [i3]Ran Canetti, Yilei Chen, Justin Holmgren
Succinct Adaptive Garbled RAM. IACR Cryptol. ePrint Arch. 2015: 1074 (2015) - [i2]Aloni Cohen, Justin Holmgren
Watermarking Cryptographic Capabilities. IACR Cryptol. ePrint Arch. 2015: 1096 (2015) - 2014
- [i1]Ran Canetti, Justin Holmgren
Indistinguishability Obfuscation of Iterated Circuits and RAM Programs. IACR Cryptol. ePrint Arch. 2014: 769 (2014) - 2010
- [c1]Catherine Havasi, Robyn Speer, Justin Holmgren
Automated Color Selection Using Semantic Knowledge. AAAI Fall Symposium: Commonsense Knowledge 2010
Coauthor Index
aka: Ron D. Rothblum
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: