Scholarlink

A t-out-of-n robust non-interactive zero-knowledge (NIZK) combiner is a construction that, given access to n candidate instantiations of a NIZK for some language, itself implements a NIZK for the same language. Moreover, the combiner is secure, assuming at least t of the given candidates are secure. In this work, we provide the first definition of robust combiners for NIZK, and prove that no robust NIZK combiner exists assuming \(t \le \lfloor n/2 \rfloor \) (unless the polynomial hierarchy collapses). On the positive side, we provide different constructions of robust NIZK combiners for \(t > \lfloor n/2 \rfloor \) . In particular, we show how to obtain:

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

Robust Non-interactive Zero-Knowledge Combiners

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Michele Ciampi,
  • Lorenzo Magliocco,
  • Daniele Venturi,
  • Yu Xia

摘要

A t-out-of-n robust non-interactive zero-knowledge (NIZK) combiner is a construction that, given access to n candidate instantiations of a NIZK for some language, itself implements a NIZK for the same language. Moreover, the combiner is secure, assuming at least t of the given candidates are secure. In this work, we provide the first definition of robust combiners for NIZK, and prove that no robust NIZK combiner exists assuming \(t \le \lfloor n/2 \rfloor \) (unless the polynomial hierarchy collapses). On the positive side, we provide different constructions of robust NIZK combiners for \(t > \lfloor n/2 \rfloor \) . In particular, we show how to obtain: