首页    期刊浏览 2025年03月01日 星期六
登录注册

文章基本信息

  • 标题:Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers
  • 本地全文:下载
  • 作者:Inbar Kaslasi ; Ron Rothblum ; Prashant Nalini Vasudevan
  • 期刊名称:Electronic Colloquium on Computational Complexity
  • 印刷版ISSN:1433-8092
  • 出版年度:2021
  • 卷号:21
  • 语种:English
  • 出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
  • 摘要:Suppose that a problem has a statistical zero-knowledge (SZK) proof with communication complexity m. The question of batch verification for SZK asks whether one can prove that k instances x1xk all belong to with a statistical zero-knowledge proof whose communication complexity is better than km (which is the complexity of the trivial solution of executing the original protocol independently on each input). In a recent work, Kaslasi et al. (TCC, 2020) constructed such a batch verification protocol for any problem having a non-interactive SZK (NISZK) proof-system. Two drawbacks of their result are that their protocol is private-coin and is only zero-knowledge with respect to the honest verifier. In this work, we eliminate these two drawbacks by constructing a public-coin malicious-verifier SZK protocol for batch verification of NISZK. Similarly to the aforementioned prior work, the communication complexity of our protocol is k+poly(m)polylog(km).
  • 关键词:Batch Verification;Statistical Zero-Knowledge Proofs
国家哲学社会科学文献中心版权所有