Protocols for Univariate Sumcheck
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917355749113856 |
|---|---|
| author | Mohamed, Malcom |
| author_facet | Mohamed, Malcom |
| contents | Three candidate approaches for univariate sumcheck over roots of unity are presented. The first takes the form of a multilinear evaluation protocol, which can be combined with the standard multivariate sumcheck protocol. The other two are reductions from univariate domain identity and univariate sumcheck to multivariate evaluation, respectively, and each can be combined with Gemini (Bootle et al., Eurocrypt 2022). Optionally, natural round reductions from $m$ to $\log(m)$ or $O(\sqrt{m})$ are supported, while retaining linear prover time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_00554 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Protocols for Univariate Sumcheck Mohamed, Malcom Cryptography and Security Three candidate approaches for univariate sumcheck over roots of unity are presented. The first takes the form of a multilinear evaluation protocol, which can be combined with the standard multivariate sumcheck protocol. The other two are reductions from univariate domain identity and univariate sumcheck to multivariate evaluation, respectively, and each can be combined with Gemini (Bootle et al., Eurocrypt 2022). Optionally, natural round reductions from $m$ to $\log(m)$ or $O(\sqrt{m})$ are supported, while retaining linear prover time. |
| title | Protocols for Univariate Sumcheck |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2505.00554 |