Scholarlink

This chapter focuses on designing efficient Non-Interactive Zero-Knowledge (NIZK) proofs using sigma-protocols. NIZK proofs, introduced in [23, 24, 66], allow proving membership in a language L without revealing extra information and typically rely on a Common Reference String (CRS) [23]. The widely used Fiat-Shamir (FS) transform [79] converts interactive proofs into NIZK arguments via a hash function in the random oracle (RO) model, enabling practical applications [40]. Lindell’s transform [141] shows how to modify the FS transform to prove its security, relying only on the correlation intractability of the random oracle. In this chapter, we propose a different approach that yields the same security as Lindell’s transform but with an improved efficiency.

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

Non-interactive Zero-Knowledge Without Programmable Random Oracles

  • 章节

  • 发表日期：

    2026年

查看全文
  • Michele Ciampi,
  • Luisa Siniscalchi

摘要

This chapter focuses on designing efficient Non-Interactive Zero-Knowledge (NIZK) proofs using sigma-protocols. NIZK proofs, introduced in [23, 24, 66], allow proving membership in a language L without revealing extra information and typically rely on a Common Reference String (CRS) [23]. The widely used Fiat-Shamir (FS) transform [79] converts interactive proofs into NIZK arguments via a hash function in the random oracle (RO) model, enabling practical applications [40]. Lindell’s transform [141] shows how to modify the FS transform to prove its security, relying only on the correlation intractability of the random oracle. In this chapter, we propose a different approach that yields the same security as Lindell’s transform but with an improved efficiency.