Benny Applebaum and Eliran Kachlon introduced the definition and construction of information-theoretically secure NPSS in the paper , which supports t-out-of-n secret sharing for any t ≤ n, and demonstrated its application in zero-knowledge proof constructions. Benny Applebaum和Eliran Kachlon在论文中提出了信息论安全的NPSS定义和构造,支持任意t≤n的t-out-of-n秘密共享,并展示了其在零知识证明组合中的应用。
Gil Segev from Coinbase proposed an extended Bulletproofs system for R1CS in the paper, aiming to bridge the gap between completeness and soundness while adding Honest Verifier Zero-Knowledge (HVZK). (HVZK means that, assuming the verifier strictly follows the protocol, the proof system ensures the verifier gains no extra knowledge about the prover's secret information. This is a weaker but practical property.) @coinbase 的 Gil Segev在论文中提出了一种扩展的Bulletproofs系统,用于R1CS,旨在弥补完整性和可靠性之间的差距,并增加了诚实验证者零知识特性。(诚实验证者零知识性(HVZK)指的是在验证者严格遵循协议的前提下,证明系统能够确保验证者无法从交互中获取任何关于证明者秘密信息的额外知识。是较弱但实用的特性。)