Justin Holmgren

发表

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

Nir Bitansky, Ran Canetti, Vinod Vaikuntanathan, 2018, SIAM J. Comput..

Delegating Computations with ( almost ) Minimal Overhead ∗ Extended Abstract

Justin Holmgren, D. Rothblum, 2018 .

Fully Homomorphic Encryption for RAMs

Daniel Wichs, Justin Holmgren, Ariel Hamlin, 2019 .

Nearly Optimal Property Preserving Hashing

Justin Holmgren, Minghao Liu, Northeastern, 2022 .

Delegation for Search Problems

R. Rothblum, Justin Holmgren, Andrea Lincoln, 2022, ICALP.

PPAD is as Hard as LWE and Iterated Squaring

Nir Bitansky, R. Rothblum, Justin Holmgren, 2022, IACR Cryptol. ePrint Arch..

Counterexamples to the Low-Degree Conjecture pdf

Alexander S. Wein, Justin Holmgren, Justin Holmgren, 2020, ITCS.

Permuted Puzzles and Cryptographic Hardness

Elette Boyle, Mor Weiss, Justin Holmgren, 2019, IACR Cryptol. ePrint Arch..

Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)

Ron D. Rothblum, R. Rothblum, Justin Holmgren, 2021, Empir. Softw. Eng..

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads

Alon Rosen, Pratik Soni, Alexander R. Block, 2020, IACR Cryptol. ePrint Arch..

Non-interactive delegation and batch NP verification from standard computational assumptions

Yael Tauman Kalai, Zvika Brakerski, Justin Holmgren, 2017, STOC.

Non-Interactive RAM and Batch NP Delegation from any PIR

Yael Tauman Kalai, Zvika Brakerski, Justin Holmgren, 2016, Electron. Colloquium Comput. Complex..

On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?

Yuval Ishai, Tal Malkin, Tianren Liu, 2020, ITCS.

On the Plausibility of Fully Homomorphic Encryption for RAMs

Daniel Wichs, Mor Weiss, Ariel Hamlin, 2019, IACR Cryptol. ePrint Arch..

(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games

Lisa Yang, Justin Holmgren, Justin Holmgren, 2017, IACR Cryptol. ePrint Arch..

Watermarking cryptographic capabilities

Vinod Vaikuntanathan, Ryo Nishimaki, Daniel Wichs, 2016, STOC.

Time- and Space-Efficient Arguments from Groups of Unknown Order

Ron Rothblum, Alon Rosen, Pratik Soni, 2021, IACR Cryptol. ePrint Arch..

Fiat-Shamir: from practice to theory

Ron Rothblum, Ran Canetti, Guy N. Rothblum, 2019, STOC.

Fiat-Shamir From Simpler Assumptions

Ron Rothblum, Ran Canetti, Guy N. Rothblum, 2018, IACR Cryptol. ePrint Arch..

Automated Color Selection Using Semantic Knowledge

Catherine Havasi, R. Speer, Justin Holmgren, 2010, AAAI Fall Symposium: Commonsense Knowledge.

Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications)

Alex Lombardi, Justin Holmgren, Justin Holmgren, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Delegating Computations with (Almost) Minimal Time and Space Overhead

Ron Rothblum, Justin Holmgren, R. Rothblum, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Faster Sounder Succinct Arguments and IOPs

R. Rothblum, Justin Holmgren, 2022, IACR Cryptol. ePrint Arch..

Fully Succinct Garbled RAM

Ran Canetti, Justin Holmgren, R. Canetti, 2016, ITCS.

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs

Ran Canetti, Vinod Vaikuntanathan, Abhishek Jain, 2015, STOC.

Succinct Adaptive Garbled RAM

Ran Canetti, Mariana Raykova, Justin Holmgren, 2015, IACR Cryptol. ePrint Arch..

Publicly Verifiable Software Watermarking

Vinod Vaikuntanathan, Aloni Cohen, Justin Holmgren, 2015, IACR Cryptol. ePrint Arch..