Scholarlink

<p>We construct a public-coin 3-round zero-knowledge argument for NP assuming the learning with errors (LWE) assumption and the existence of keyless multi-collision-resistant hash functions (both of which are assumed secure against slightly super-polynomial-time adversaries). Prior to this work, a private-coin 3-round zero-knowledge argument was obtained from the same set of assumptions as reported by (Bitansky et al. in: Diakonikolas, Kempe, and Henzinger (eds.) 50th ACM STOC, ACM Press, 2018).</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash

  • 期刊论文

  • 发表日期：

    2025年11月5日

查看全文
  • Susumu Kiyoshima

摘要

We construct a public-coin 3-round zero-knowledge argument for NP assuming the learning with errors (LWE) assumption and the existence of keyless multi-collision-resistant hash functions (both of which are assumed secure against slightly super-polynomial-time adversaries). Prior to this work, a private-coin 3-round zero-knowledge argument was obtained from the same set of assumptions as reported by (Bitansky et al. in: Diakonikolas, Kempe, and Henzinger (eds.) 50th ACM STOC, ACM Press, 2018).