TCC2021论文简介-零知识和证明系统

Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs统一了构造简洁证明系统的两个主要范式：Kilian协议和BMW启发式。定义multi-extractable somewhere statistically binding (meSSB) hash family，由LWE构造。用meSSB hash实例化Kilian协议时，前两个消息恰为BMW启发式的实例化。展示如何将任意SNARG for BatchNP转换为SNARG for any language that has a computational non-signaling PCP。给出somewhere statistically sound (SSS)交互式证明系统定义。https://eprint.iacr.org/2021/788

Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness研究两轮Weak ZK and Strong WI 的交互式论证系统。给出下列黑盒不可能结论：在多项式困难可证伪假设下不可能黑盒归约得到2轮delayed-input weak ZK，不可能得到2轮non-delayed-input strong WI 以及不可能得到publicly verifiable delayed-input strong WI。https://eprint.iacr.org/2021/1214.pdf

Acyclicity Programming for Sigma-Protocols提出一种ROM中对于复合语句组合sigma协议为非交互式系统的和CDS不同的方法，降低验证复杂度。提出acyclicity program，一种相对monotone span program的新型访问结构表示。https://eprint.iacr.org/2021/135.pdf

Statistical ZAPs from Group-Based Assumptions提出构造统计ZAPs for NP的模板。使用interactive hidden-bit generator (IHBG) 将hidden-bit模型中的任意NIZK。基于DDH给出IHBG构造。https://eprint.iacr.org/2021/688.pdf

Generalized Proofs of Knowledge with Fully Dynamic Setup给出PoK的概念推广 agree-and-prove，包括了动态和设置依赖关系，以及交互式语句推导。在新框架下形式化了proofs-of-ownership of files for client-side file deduplication以及双因子实体认证。https://eprint.iacr.org/2019/662.pdf

Simple and Efficient Batch Verification Techniques for Verifiable Delay FunctionsVDF的批量验证问题，集中于其中的proofs of correct exponentiation (PoCE)。展示如何将任意PoCE批量化，节省通信开销和验证时间。https://eprint.iacr.org/2021/1209.pdf