Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Cody Freitag, Omer Paneth, Rafael Pass
2024年份
1被引次数
1顶会引用
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant HashSusumu KiyoshimaCRYPTO 2022 · 被引用 5 次
- SNARKs from LWE via Non-black-Box ReductionsZhengzhong Jin, Mingqi Lu, Bo PengSTOC 2026
- Round-Optimal Black-Box Commit-and-Prove with Succinct CommunicationSusumu KiyoshimaCRYPTO 2020 · 被引用 7 次
- On Succinct Non-interactive Arguments in Relativized WorldsMegan Chen, Alessandro Chiesa, Nicholas SpoonerEUROCRYPT 2022 · 被引用 14 次
- On the Complexity of Interactive ArgumentsIdan Baril, Iftach HaitnerCRYPTO 2026
