Scholarlink

We present a new approach for constructing non-interactive zero-knowledge (NIZK) proof systems from vector trapdoor hashing (VTDH) – a generalization of trapdoor hashing [Döttling et al., Crypto’19]. Unlike prior applications of trapdoor hash to NIZKs, we use VTDH to realize the hidden bits model [Feige-Lapidot-Shamir, FOCS’90] leading to black-box constructions of NIZKs. This approach gives us the following new results: The above constructions are black-box and satisfy single-theorem zero-knowledge property. Building on the works of Feige et al.(FOCS’90) and Fischlin and Rohrback (PKC’21), we upgrade these constructions (under the same assumptions) to satisfy multi-theorem zero-knowledge property at the expense of making non-black-box use of cryptography.

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

Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Pedro Branco,
  • Arka Rai Choudhuri,
  • Nico Döttling,
  • Abhishek Jain,
  • Giulio Malavolta,
  • Akshayaram Srinivasan

摘要

We present a new approach for constructing non-interactive zero-knowledge (NIZK) proof systems from vector trapdoor hashing (VTDH) – a generalization of trapdoor hashing [Döttling et al., Crypto’19]. Unlike prior applications of trapdoor hash to NIZKs, we use VTDH to realize the hidden bits model [Feige-Lapidot-Shamir, FOCS’90] leading to black-box constructions of NIZKs. This approach gives us the following new results: The above constructions are black-box and satisfy single-theorem zero-knowledge property. Building on the works of Feige et al.(FOCS’90) and Fischlin and Rohrback (PKC’21), we upgrade these constructions (under the same assumptions) to satisfy multi-theorem zero-knowledge property at the expense of making non-black-box use of cryptography.