On Round Optimal Statistical Zero Knowledge Arguments.
ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT III(2019)
摘要
We construct the first three message statistical zero knowledge arguments for all of NP, matching the known lower bound. We do so based on keyless multi-collision resistant hash functions and the Learning with Errors assumption-the same assumptions used to obtain round optimal computational zero knowledge. The main component in our construction is a statistically witness indistinguishable argument of knowledge based on a new notion of statistically hiding commitments with subset opening.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络