2 papers
cs.CR2025
Quantum Rewinding for IOP-Based Succinct Arguments
Alessandro Chiesa, Marcel Dall Agnol, Zijing Di +2
We analyze the post-quantum security of succinct interactive arguments constructed from interactive oracle proofs (IOPs) and vector commitment schemes. We prove that an interactive…
cs.CC2025
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
Ziyi Guan, Yunqi Huang, Penghui Yao +1
This paper gives a nearly tight characterization of the quantum communication complexity of the permutation-invariant Boolean functions. With such a characterization, we show that…