Zero-Knowledge IOPs Approaching Witness Length

被引:0
|
作者
Ron-Zewi, Noga [1 ]
Weiss, Mor [2 ]
机构
[1] Univ Haifa, Haifa, Israel
[2] Bar Ilan Univ, Ramat Gan, Israel
来源
关键词
PRODUCTS;
D O I
10.1007/978-3-031-68403-6_4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Interactive Oracle Proofs (IOPs) allow a probabilistic verifier interacting with a prover to verify the validity of an NP statement while reading only few bits from the prover messages. IOPs generalize standard Probabilistically-Checkable Proofs (PCPs) to the interactive setting, and in the few years since their introduction have already exhibited major improvements in main parameters of interest (such as the proof length and prover and verifier running times), which in turn led to significant improvements in constructions of succinct arguments. Zero-Knowledge (ZK) IOPs additionally guarantee that the view of any query-bounded (possibly malicious) verifier can be efficiently simulated. ZK-IOPs are the main building block of succinct ZK arguments which use the underlying cryptographic object (e.g., a collision-resistant hash function) as a black box. In this work, we construct the first ZK-IOPs approaching the witness length for a natural NP problem. More specifically, we design constantquery and constant-round IOPs for 3SAT in which the total communication is (1 +gamma)m, where m is the number of variables and gamma > 0 is an arbitrarily small constant, and ZK holds against verifiers querying m(beta) bits from the prover's messages, for a constant beta > 0. This gives a ZK variant of a recent result of Ron-Zewi and Rothblum (FOCS '20), who construct (non-ZK) IOPs approaching the witness length for a large class of NP languages. Previous constructions of ZK-IOPs incurred an (unspecified) large constant multiplicative overhead in the proof length, even when restricting to ZK against the honest verifier. We obtain our ZK-IOPs by improving the two main building blocks underlying most ZK-IOP constructions, namely ZK codes and ZK-IOPs for sumcheck. More specifically, we give the first ZK-IOPs for sumcheck that achieve both sublinear communication for sumchecking a general tensor code, and a ZK guarantee. We also show a strong ZK preservation property for tensors of ZK codes, which extends a recent result of Bootle, Chiesa, and Liu (EC '22). Given the central role of these objects in designing ZK-IOPs, these results might be of independent interest.
引用
收藏
页码:105 / 137
页数:33
相关论文
共 50 条
  • [1] Zero-Knowledge Proofs with Witness Elimination
    Kiayias, Aggelos
    Zhou, Hong-Sheng
    PUBLIC KEY CRYPTOGRAPHY-PKC 2009, PROCEEDINGS, 2009, 5443 : 124 - 138
  • [2] Polynomial IOPs for Memory Consistency Checks in Zero-Knowledge Virtual Machines
    Zhang, Yuncong
    Sun, Shi-Feng
    Zhang, Ren
    Gu, Dawu
    ADVANCES IN CRYPTOLOGY, ASIACRYPT 2023, PT II, 2023, 14439 : 111 - 141
  • [3] Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier
    Bootle, Jonathan
    Chiesa, Alessandro
    Liu, Siqi
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT II, 2022, 13276 : 275 - 304
  • [4] Improved Zero-Knowledge Identification with Improved Zero-Knowledge Identification with Lattices
    Cayrel, Pierre-Louis
    Lindner, Richard
    Rueckert, Markus
    Silva, Rosemberg
    PROVABLE SECURITY, 2010, 6402 : 1 - +
  • [5] Zero-Knowledge Middleboxes
    Grubbs, Paul
    Arun, Arasu
    Zhang, Ye
    Bonneau, Joseph
    Walfish, Michael
    PROCEEDINGS OF THE 31ST USENIX SECURITY SYMPOSIUM, 2022, : 4255 - 4272
  • [6] Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
    Song, Yongcheng
    Zhang, Jiang
    Huang, Xinyi
    Wu, Wei
    Yang, Haining
    THEORETICAL COMPUTER SCIENCE, 2023, 952
  • [7] ZERO-KNOWLEDGE PROOFS
    MCGEOCH, CC
    AMERICAN MATHEMATICAL MONTHLY, 1993, 100 (07): : 682 - 685
  • [8] Reduction zero-knowledge
    Zhao, YL
    Deng, XT
    Lee, CH
    Zhu, H
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2004, 14 (04) : 350 - 358
  • [9] Concurrent zero-knowledge
    Dwork, C
    Naor, M
    Sahai, A
    JOURNAL OF THE ACM, 2004, 51 (06) : 851 - 898
  • [10] Zero-Knowledge in EasyCrypt
    Firsov, Denis
    Unruh, Dominique
    2023 IEEE 36TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM, CSF, 2023, : 1 - 16