6 citations · 12 across the 7 of their papers we have counts for
Showing 2026 · quant-phShow all
3 papers · 2 filters
quant-ph2026
Computational Bounds for -Routing
Oren Renard, Nicholas Spooner
The -routing protocol is a leading candidate for quantum position verification (Kent, Munro, and Spiller, 2011), but security guarantees for explicit functions remain limited. W…
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-ph2026
On Removing Interaction from Quantum Proofs
Nicholas Spooner, Max Tromanhauser
An important open question in quantum cryptography is the construction of publicly-verifiable NIZKs for QMA. Classically, one can construct NIZKs for NP in the random oracle model…