Succinct PPRFs via Memory-Tight Reductions
Joël Alwen, Chris Brzuska, Jérôme Govinden, Patrick Harasser, Stefano Tessaro
2025年份
3被引次数
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。
相关 Paper
- Succinct Arguments for RAM Programs via Projection CodesYuval Ishai, Rafail Ostrovsky, Akash ShahCRYPTO 2023 · 被引用 2 次
- Hiding in Plain Sight: Memory-Tight Proofs via Randomness ProgrammingAshrujit Ghoshal, Riddhi Ghosal, Joseph Jaeger, Stefano TessaroEUROCRYPT 2022 · 被引用 5 次
- NTPIR: Efficient Silent-Preprocessing PIR using NTRUZhihao Li, Cheng HongCCS 2026
- Succinct Non-interactive Arguments for DistributionsZhengzhong Jin, Mingqi Lu, Bo Peng, Yue YuCRYPTO 2026
- Pseudorandom Functions with Weak Programming Privacy and Applications to Private Information RetrievalAshrujit Ghoshal, Mingxun Zhou, Elaine Shi, Bo PengEUROCRYPT 2025 · 被引用 2 次
