Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments

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.

Cited by top-tier papers17

• Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract)Martin R. Albrecht, Valerio Cini, Russell W. F. Lai, Giulio Malavolta et al.CRYPTO 2022 · 73 citations
• Succinct Vector, Polynomial, and Functional Commitments from LatticesHoeteck Wee, David J. WuEUROCRYPT 2023 · 54 citations
• Reinforced Concrete: A Fast Hash Function for Verifiable ComputationLorenzo Grassi, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger et al.CCS 2022 · 34 citations
• Nurgle: Exacerbating Resource Consumption in Blockchain State Storage via MPT ManipulationZheyuan He, Zihao Li, Ao Qiao, Xiapu Luo et al.S&P 2024 · 21 citations
• SNARKBlock: Federated Anonymous Blocklisting from Hidden Common Input Aggregate ProofsMichael Rosenberg, Mary Maller, Ian MiersS&P 2022 · 18 citations

Related papers

• Proof-Carrying Data Without Succinct ArgumentsBenedikt Bünz, Alessandro Chiesa, William Lin, Pratyush Mishra et al.CRYPTO 2021 · 58 citations
• Secure Multiparty Computation with Sublinear PreprocessingElette Boyle, Niv Gilboa, Yuval Ishai, Ariel NofEUROCRYPT 2022 · 12 citations
• Sometimes-Decryptable Homomorphic Encryption from Sub-exponential DDHAbhishek Jain, Zhengzhong JinCRYPTO 2025 · 2 citations
• Statistically Secure Asynchronous MPC with Linear Communication and 풪(n5) Additive OverheadXiaoyu Ji, Yifan SongCRYPTO 2026
• Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$Yuhao Jia, Songsong Li, Chaoping Xing, Yizhou Yao et al.CRYPTO 2025 · 1 citation