ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2103.11244
26
10

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds

20 March 2021
Nai-Hui Chia
Kai-Min Chung
Qipeng Liu
Takashi Yamakawa
ArXivPDFHTML
Abstract

We investigate the existence of constant-round post-quantum black-box zero-knowledge protocols for NP\mathbf{NP}NP. As a main result, we show that there is no constant-round post-quantum black-box zero-knowledge argument for NP\mathbf{NP}NP unless NP⊆BQP\mathbf{NP}\subseteq \mathbf{BQP}NP⊆BQP. As constant-round black-box zero-knowledge arguments for NP\mathbf{NP}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\mathbf{NP}\subseteq \mathbf{BQP}NP⊆BQP, constant-round post-quantum zero-knowledge protocols for NP\mathbf{NP}NP exist if and only if we use non-black-box techniques or relax certain security requirements such as relaxing standard zero-knowledge to ϵ\epsilonϵ-zero-knowledge. Additionally, we also prove that three-round and public-coin constant-round post-quantum black-box ϵ\epsilonϵ-zero-knowledge arguments for NP\mathbf{NP}NP do not exist unless NP⊆BQP\mathbf{NP}\subseteq \mathbf{BQP}NP⊆BQP.

View on arXiv
Comments on this paper