Unique NIZKs and Steganography Detection
Willy Quach, LaKyah Tyner, Daniel Wichs
2025年份
2被引次数
摘要
Non-interactive zero-knowledge (NIZK) proofs tend to be randomized and there are many possible proofs for any fixed NP statement. Can we have NIZKs with only a single unique valid proof per statement? Such NIZKs are known under strong cryptographic assumptions (indistinguishability obfuscation), and are conversely known to require strong cryptographic assumptions (witness encryption). In this work, following Lepinski, Micali, and shelat (TCC ’05), we consider the following relaxed notion of unique NIZKs (UNIZKs):
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Universally Composable SNARKs with Transparent Setup without Programmable Random OracleChristian Badertscher, Matteo Campanelli, Michele Ciampi, Luigi Russo 等CRYPTO 2025 · 被引用 3 次
- Witness Authenticating NIZKs and ApplicationsHanwen Feng, Qiang TangCRYPTO 2021 · 被引用 2 次
- Resettable Statistical Zero-Knowledge for Susumu KiyoshimaCRYPTO 2024 · 被引用 1 次
- On Weak NIZKs, One-Way Functions and AmplificationSuvradip Chakraborty, James Hulett, Dakshita KhuranaCRYPTO 2025 · 被引用 1 次
- Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable CommitmentsDakshita KhuranaEUROCRYPT 2021 · 被引用 8 次
