Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Cody Freitag, Omer Paneth, Rafael Pass
2024Year
1Citations
1Top-tier citations
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 04da4bb5-d9e7-4c72-b682-a4e5602973acCited by top-tier papers1
Ask how each one uses itRelated papers
- Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant HashSusumu KiyoshimaCRYPTO 2022 · 5 citations
- 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 citations
- On Succinct Non-interactive Arguments in Relativized WorldsMegan Chen, Alessandro Chiesa, Nicholas SpoonerEUROCRYPT 2022 · 14 citations
- On the Complexity of Interactive ArgumentsIdan Baril, Iftach HaitnerCRYPTO 2026
