When do classical zero-knowledge protocols remain secure against quantum attacks? In
this work, we develop the techniques, tools, and abstractions necessary to answer this …

We construct a classically verifiable succinct interactive argument for quantum computation
(BQP) with communication complexity and verifier runtime that are poly-logarithmic in the …

Recently, significant progress has been made toward quantumly secure multi-party
computation (MPC) in the stand-alone setting. In sharp contrast, the picture of concurrently …

We construct a classical oracle relative to which $\mathsf {P}=\mathsf {NP} $ but quantum-
computable quantum-secure trapdoor one-way functions exist. This is a substantial …

We provide the first constant-round construction of post-quantum non-malleable
commitments under the minimal assumption that post-quantum one-way functions exist. We …

We construct, under standard hardness assumptions, the first non-malleable commitments
secure against quantum attacks. Our commitments are statistically binding and satisfy the …

Zero-Knowledge (ZK) protocols have been intensely studied due to their fundamental
importance and versatility. However, quantum information's inherent differences significantly …

The traditional definition of quantum zero-knowledge stipulates that the knowledge gained
by any quantum polynomial-time verifier in an interactive protocol can be simulated by a …

We construct a classically verifiable succinct interactive argument for quantum computation
(BQP) with communication complexity and verifier runtime that are poly-logarithmic in the …