Quantum Statistical Witness Indistinguishability
By: Shafik Nassar, Ronak Ramachandran
Potential Business Impact:
Keeps secrets safe even with quantum computers.
Statistical witness indistinguishability is a relaxation of statistical zero-knowledge which guarantees that the transcript of an interactive proof reveals no information about which valid witness the prover used to generate it. In this paper we define and initiate the study of QSWI, the class of problems with quantum statistically witness indistinguishable proofs. Using inherently quantum techniques from Kobayashi (TCC 2008), we prove that any problem with an honest-verifier quantum statistically witness indistinguishable proof has a 3-message public-coin malicious-verifier quantum statistically witness indistinguishable proof. There is no known analogue of this result for classical statistical witness indistinguishability. As a corollary, our result implies SWI is contained in QSWI. Additionally, we extend the work of Bitansky et al. (STOC 2023) to show that quantum batch proofs imply quantum statistically witness indistinguishable proofs with inverse-polynomial witness indistinguishability error.
Similar Papers
A slightly improved upper bound for quantum statistical zero-knowledge
Quantum Physics
Makes secret computer codes with less memory.
The Knowledge Complexity of Quantum Problems
Quantum Physics
Lets computers prove secrets without revealing them.
Device Independent Quantum Secret Sharing Using Multiparty Pseudo-telepathy Game
Quantum Physics
Lets secret messages be safe even with bad machines.