01365nas a2200145 4500008004100000245008500041210006900126260001400195520089800209100001801107700001901125700001601144700002201160856003701182 2021 eng d00aOn the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds0 aImpossibility of PostQuantum BlackBox ZeroKnowledge in Constant  c3/20/20213 a

We investigate the existence of constant-round post-quantum black-box zero-knowledge protocols for NP. As a main result, we show that there is no constant-round post-quantum black-box zero-knowledge argument for NP unless NP⊆BQP. As constant-round black-box zero-knowledge arguments for NP exist in the classical setting, our main result points out a fundamental difference between post-quantum and classical zero-knowledge protocols. Combining previous results, we conclude that unless NP⊆BQP, constant-round post-quantum zero-knowledge protocols for NP exist if and only if we use non-black-box techniques or relax certain security requirements such as relaxing standard zero-knowledge to ϵ-zero-knowledge. Additionally, we also prove that three-round and public-coin constant-round post-quantum black-box ϵ-zero-knowledge arguments for NP do not exist unless NP⊆BQP.

1 aChia, Nai-Hui1 aChung, Kai-Min1 aLiu, Qipeng1 aYamakawa, Takashi uhttps://arxiv.org/abs/2103.1124402079nas a2200133 4500008004100000245007500041210006900116260001400185520165000199100001801849700001901867700002201886856003701908 2020 eng d00aA Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds0 aBlackBox Approach to PostQuantum ZeroKnowledge in Constant Round c11/5/20203 a

In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first construction of a constant round zero-knowledge argument for NP secure against quantum attacks. However, their construction has several drawbacks compared to the classical counterparts. Specifically, their construction only achieves computational soundness, requires strong assumptions of quantum hardness of learning with errors (QLWE assumption) and the existence of quantum fully homomorphic encryption (QFHE), and relies on non-black-box simulation. In this paper, we resolve these issues at the cost of weakening the notion of zero-knowledge to what is called ε-zero-knowledge. Concretely, we construct the following protocols: - We construct a constant round interactive proof for NP that satisfies statistical soundness and black-box ε-zero-knowledge against quantum attacks assuming the existence of collapsing hash functions, which is a quantum counterpart of collision-resistant hash functions. Interestingly, this construction is just an adapted version of the classical protocol by Goldreich and Kahan (JoC '96) though the proof of ε-zero-knowledge property against quantum adversaries requires novel ideas. - We construct a constant round interactive argument for NP that satisfies computational soundness and black-box ε-zero-knowledge against quantum attacks only assuming the existence of post-quantum one-way functions. At the heart of our results is a new quantum rewinding technique that enables a simulator to extract a committed message of a malicious verifier while simulating verifier's internal state in an appropriate sense.

1 aChia, Nai-Hui1 aChung, Kai-Min1 aYamakawa, Takashi uhttps://arxiv.org/abs/2011.0267002263nas a2200145 4500008004100000245006800041210006700109260001400176520182500190100001902015700001202034700001902046700001502065856003702080 2020 eng d00aConstant-round Blind Classical Verification of Quantum Sampling0 aConstantround Blind Classical Verification of Quantum Sampling c12/8/20203 a

In a recent breakthrough, Mahadev constructed a classical verification of quantum computation (CVQC) protocol for a classical client to delegate decision problems in BQP to an untrusted quantum prover under computational assumptions. In this work, we explore further the feasibility of CVQC with the more general sampling problems in BQP and with the desirable blindness property. We contribute affirmative solutions to both as follows. (1) Motivated by the sampling nature of many quantum applications (e.g., quantum algorithms for machine learning and quantum supremacy tasks), we initiate the study of CVQC for quantum sampling problems (denoted by SampBQP). More precisely, in a CVQC protocol for a SampBQP problem, the prover and the verifier are given an input x∈{0,1}n and a quantum circuit C, and the goal of the classical client is to learn a sample from the output z←C(x) up to a small error, from its interaction with an untrusted prover. We demonstrate its feasibility by constructing a four-message CVQC protocol for SampBQP based on the quantum Learning With Error assumption. (2) The blindness of CVQC protocols refers to a property of the protocol where the prover learns nothing, and hence is blind, about the client's input. It is a highly desirable property that has been intensively studied for the delegation of quantum computation. We provide a simple yet powerful generic compiler that transforms any CVQC protocol to a blind one while preserving its completeness and soundness errors as well as the number of rounds. Applying our compiler to (a parallel repetition of) Mahadev's CVQC protocol for BQP and our CVQC protocol for SampBQP yields the first constant-round blind CVQC protocol for BQP and SampBQP respectively, with negligible completeness and soundness errors.

1 aChung, Kai-Min1 aLee, Yi1 aLin, Han-Hsuan1 aWu, Xiaodi uhttps://arxiv.org/abs/2012.0484801895nas a2200157 4500008004100000245004900041210004800090260001500138520145500153100001801608700001901626700001801645700002201663700001501685856003701700 2017 eng d00aComputational Notions of Quantum Min-Entropy0 aComputational Notions of Quantum MinEntropy c2017/09/093 a

We initiate the study of computational entropy in the quantum setting. We investigate to what extent the classical notions of computational entropy generalize to the quantum setting, and whether quantum analogues of classical theorems hold. Our main results are as follows. (1) The classical Leakage Chain Rule for pseudoentropy can be extended to the case that the leakage information is quantum (while the source remains classical). Specifically, if the source has pseudoentropy at least k, then it has pseudoentropy at least k − ℓ conditioned on an ℓ- qubit leakage. (2) As an application of the Leakage Chain Rule, we construct the first quantum leakage-resilient stream-cipher in the bounded-quantum-storage model, assuming the existence of a quantum-secure pseudorandom generator. (3) We show that the general form of the classical Dense Model Theorem (interpreted as the equivalence between two definitions of pseudo-relativemin-entropy) does not extend to quantum states. Along the way, we develop quantum analogues of some classical techniques (e.g., the Leakage Simulation Lemma, which is proven by a Nonuniform Min-Max Theorem or Boosting). On the other hand, we also identify some classical techniques (e.g., Gap Amplification) that do not work in the quantum setting. Moreover, we introduce a variety of notions that combine quantum information and quantum complexity, and this raises several directions for future work.

1 aChen, Yi-Hsiu1 aChung, Kai-Min1 aLai, Ching-Yi1 aVadhan, Salil, P.1 aWu, Xiaodi uhttps://arxiv.org/abs/1704.07309