13 citations · 13 across the 3 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Tight Post-Quantum Parallel Repetition for Private-Coin Arguments
Zvika Brakerski, Andrew Huang, Yael Tauman Kalai +1
We show that assuming the existence of homomorphic encryption, parallel repetition of all interactive arguments (after being run under homomorphic encryption) reduces the soundness…
quant-ph2025
Compiling Any into a (Succinct) Classical Interactive Argument
Andrew Huang, Yael Tauman Kalai
We present a generic compiler that converts any protocol into a succinct interactive argument where the communication and the verifier are classical, and where p…
quant-ph2025
Parallel Repetition for Post-Quantum Arguments
Andrew Huang, Yael Tauman Kalai
In this work, we show that parallel repetition of public-coin interactive arguments reduces the soundness error at an exponential rate even in the post-quantum setting. Moreover, w…